Regular semantics

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.

[edit] See also

[edit] References


Personal tools
Namespaces

Variants
Actions
Navigation
Interaction
Toolbox
Print/export