000 | 03184nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-031-02007-0 | ||
003 | DE-He213 | ||
005 | 20240730163752.0 | ||
007 | cr nn 008mamaa | ||
008 | 220601s2012 sz | s |||| 0|eng d | ||
020 |
_a9783031020070 _9978-3-031-02007-0 |
||
024 | 7 |
_a10.1007/978-3-031-02007-0 _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 |
_aVukolic, Marko. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _980481 |
|
245 | 1 | 0 |
_aQuorum Systems _h[electronic resource] : _bWith Applications to Storage and Consensus / _cby Marko Vukolic. |
250 | _a1st ed. 2012. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2012. |
|
300 |
_aXV, 130 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 | _aIntroduction -- Preliminaries -- Classical Quorum Systems -- Classical Quorum-Based Emulations -- Byzantine Quorum Systems -- Latency-efficient Quorum Systems -- Probabilistic Quorum Systems. | |
520 | _aA quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Quorum systems are the key mathematical abstraction for ensuring consistency in fault-tolerant and highly available distributed computing. Critical for many applications since the early days of distributed computing, quorum systems have evolved from simple majorities of a set of processes to complex hierarchical collections of sets, tailored for general adversarial structures. The initial non-empty intersection property has been refined many times to account for, e.g., stronger (Byzantine) adversarial model, latency considerations or better availability. This monograph is an overview of the evolution and refinement of quorum systems, with emphasis on their role in two fundamental applications: distributed read/write storage and consensus. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems. | ||
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. _980482 |
650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
710 | 2 |
_aSpringerLink (Online service) _980483 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031008795 |
776 | 0 | 8 |
_iPrinted edition: _z9783031031359 |
830 | 0 |
_aSynthesis Lectures on Distributed Computing Theory, _x2155-1634 _980484 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-02007-0 |
912 | _aZDB-2-SXSC | ||
942 | _cEBK | ||
999 |
_c84968 _d84968 |