000 a
999 _c30820
_d30820
008 220616b xxu||||| |||| 00| 0 eng d
020 _a9781636390628
082 _a005.425
_bGRA
100 _aGramoli, Vincent
245 _aConsistent distributed storage
260 _bMorgan and Claypool publishers,
_c2021
_aSan Rafael :
300 _axv, 176 p. ;
_bill.,
_c24 cm
365 _b79.95
_cUSD
_d81.20
490 _aSynthesis Lectures on Distributed Computing Theory Series
504 _aIncludes Bibliographical references and Index
520 _aProviding a shared memory abstraction in distributed systems is a powerful tool that can simplify the design and implementation of software systems for networked platforms. This enables the system designers to work with abstract readable and writable objects without the need to deal with the complexity and dynamism of the underlying platform. The key property of shared memory implementations is the consistency guarantee that it provides under concurrent access to the shared objects. The most intuitive memory consistency model is atomicity because of its equivalence with a memory system where accesses occur serially, one at a time. Emulations of shared atomic memory in distributed systems is an active area of research and development. The problem proves to be challenging, and especially so in distributed message passing settings with unreliable components, as is often the case in networked systems. We present several approaches to implementing shared memory services with the help of replication on top of message-passing distributed platforms subject to a variety of perturbations in the computing medium.
650 _aMemory management
650 _a Ad hoc mobile networks
650 _a Biquorums
650 _a Configuration changes
650 _aDirected acyclic graph
650 _aDyna Store
650 _a Execution fragment
650 _a Failure model
650 _a Incremental reconfiguration
650 _aLexicographical order
650 _aPaxos
650 _a Quorum system
650 _a Replica host
650 _aWeak snapshot
650 _aWell formedness
650 _a Write operation
700 _aNicolaou, Nicolas
700 _aSchwarzmann, Alexander A.
700 _aRaynal, Michel
_eed.
942 _2ddc
_cBK