Regular semantics is a computing term which describes the guarantees provided by a data register shared by several processors in a parallel machine or in a network of computers working together. Regular semantics are defined for a variable with a single writer but multiple readers. These semantics are stronger than safe semantics but weaker than atomic semantics: they guarantee that there is a total order to the write operations which is consistent with real-time and that read operations return either the value of the last completed write or that of one of the writes which are concurrent with the read.
Famous quotes containing the word regular:
““I couldn’t afford to learn it,” said the Mock Turtle with a sigh. “I only took the regular course.”
“What was that?” inquired Alice.
“Reeling and Writhing, of course, to begin with,” the Mock Turtle replied; “and then the different branches of Arithmetic—Ambition, Distraction, Uglification, and Derision.”
“I never heard of ‘Uglification,’” Alice ventured to say.”
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)