Atomic semantics
 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (January 2013) |
Atomic semantics is a 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.
The read and write registers are one of the important and basic objects encountered in distributed theory systems. Atomic semantics are very strong. An atomic register provides strong guarantees even when there is concurrency and failures.A register R could be accessed by two base operations: R.Read ,and R.write(v).The R.Read will return the value of R and R.write(v) writes a new value into R. A register is called atomic semantic if it satisfies the two following properties: 1)Each invocation operation of a read or write operation :
- Should become visible just as if it was executed already at an only one point τ(op)
- τ (op) works as follow:
τb(op) ≤ τ (op) ≤ τe(op): where τb(op) and τe(op) indicate the time where exactly the operation op started and finished.
- If op1 = op2) ⇒τ (op1)≠τ (op2)
2) Every read operation returns the value written by the closest write which came before write invocation in the sequence by the τ () associated with the operation invocations .It means that an atomic register is defined where all its operation invocations have been executed sequentially.
An atomic register is one that is linearizable to a sequential safe register.As it shown in the picture.
An atomic register could be defined for a variable with a single writer but multiple readers(SWMR) or single-writer/multi-reader (SWMR), or multi-writer/multi-reader(MWMR).
See also
References
- Atomic semantics are defined formally in Lamport's "On Interprocess Communication" Distributed Computing 1, 2 (1986), 77-101. (Also appeared as SRC Research Report 8).