000 03675nam a22005535i 4500
001 978-3-031-02015-5
003 DE-He213
005 20240730163755.0
007 cr nn 008mamaa
008 220601s2021 sz | s |||| 0|eng d
020 _a9783031020155
_9978-3-031-02015-5
024 7 _a10.1007/978-3-031-02015-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM000000
_2bisacsh
072 7 _aUY
_2thema
082 0 4 _a004
_223
100 1 _aGramoli, Vincent.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980504
245 1 0 _aConsistent Distributed Storage
_h[electronic resource] /
_cby Vincent Gramoli, Nicolas Nicolaou, Alexander A. Schwarzmann.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXV, 176 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Distributed Computing Theory,
_x2155-1634
505 0 _aAcknowledgments -- 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 .
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 0 _aComputer science.
_99832
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aData structures (Computer science).
_98188
650 1 4 _aComputer Science.
_99832
650 2 4 _aCoding and Information Theory.
_980505
650 2 4 _aData Structures and Information Theory.
_931923
700 1 _aNicolaou, Nicolas.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980506
700 1 _aSchwarzmann, Alexander A.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980507
710 2 _aSpringerLink (Online service)
_980508
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031001338
776 0 8 _iPrinted edition:
_z9783031008870
776 0 8 _iPrinted edition:
_z9783031031434
830 0 _aSynthesis Lectures on Distributed Computing Theory,
_x2155-1634
_980509
856 4 0 _uhttps://doi.org/10.1007/978-3-031-02015-5
912 _aZDB-2-SXSC
942 _cEBK
999 _c84972
_d84972