A Broadcast Abstraction Suited to the Family of Read/Write Implementable Objects
Chapter 6 presented algorithms constructing atomic and sequentially consistent read/write registers in the system model CAMPn,t[t < n/2] (which, from a t-resilience point of view, is the weakest system model in which such read/write registers can be built). All these algorithms rely directly on the unreliable macro-operation denoted broadcast(), i.e., on the send() and receive() operations, which are “machine/network” low level operations.
KeywordsAsynchronous system Atomicity Communication abstraction Communication pattern Computability equivalence Conflict-free replicated data type Counter object Lattice agreement task Process crash failure Read/write register Sequential consistency Snapshot object
Unable to display preview. Download preview PDF.