Gramoli, Vincent.
Consistent Distributed Storage [electronic resource] / by Vincent Gramoli, Nicolas Nicolaou, Alexander A. Schwarzmann. - 1st ed. 2021. - XV, 176 p. online resource. - Synthesis Lectures on Distributed Computing Theory, 2155-1634 . - Synthesis Lectures on Distributed Computing Theory, .
Acknowledgments -- Outline -- Introduction -- Model of Computation -- The Static Environment -- The Single-Writer Setting -- The Multiple-Writer Setting -- The Dynamic Environment -- RAMBO: Reconfigurable Dynamic Memory -- RDS: Integrated Reconfigurations -- DynaStore: Incremental Reconfigurations -- Concluding Remarks and Looking Ahead -- Bibliography -- Authors' Biographies -- Index .
Providing 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.
9783031020155
10.1007/978-3-031-02015-5 doi
Computer science.
Coding theory.
Information theory.
Data structures (Computer science).
Computer Science.
Coding and Information Theory.
Data Structures and Information Theory.
QA75.5-76.95
004
Consistent Distributed Storage [electronic resource] / by Vincent Gramoli, Nicolas Nicolaou, Alexander A. Schwarzmann. - 1st ed. 2021. - XV, 176 p. online resource. - Synthesis Lectures on Distributed Computing Theory, 2155-1634 . - Synthesis Lectures on Distributed Computing Theory, .
Acknowledgments -- Outline -- Introduction -- Model of Computation -- The Static Environment -- The Single-Writer Setting -- The Multiple-Writer Setting -- The Dynamic Environment -- RAMBO: Reconfigurable Dynamic Memory -- RDS: Integrated Reconfigurations -- DynaStore: Incremental Reconfigurations -- Concluding Remarks and Looking Ahead -- Bibliography -- Authors' Biographies -- Index .
Providing 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.
9783031020155
10.1007/978-3-031-02015-5 doi
Computer science.
Coding theory.
Information theory.
Data structures (Computer science).
Computer Science.
Coding and Information Theory.
Data Structures and Information Theory.
QA75.5-76.95
004