Quorum Systems (Record no. 84968)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03184nam a22005175i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-031-02007-0 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730163752.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 220601s2012 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783031020070 |
| -- | 978-3-031-02007-0 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004 |
| 100 1# - AUTHOR NAME | |
| Author | Vukolic, Marko. |
| 245 10 - TITLE STATEMENT | |
| Title | Quorum Systems |
| Sub Title | With Applications to Storage and Consensus / |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2012. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XV, 130 p. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Synthesis Lectures on Distributed Computing Theory, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Introduction -- Preliminaries -- Classical Quorum Systems -- Classical Quorum-Based Emulations -- Byzantine Quorum Systems -- Latency-efficient Quorum Systems -- Probabilistic Quorum Systems. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | A 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. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/978-3-031-02007-0 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2012. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Coding theory. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Information theory. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data structures (Computer science). |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Coding and Information Theory. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data Structures and Information Theory. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 2155-1634 |
| 912 ## - | |
| -- | ZDB-2-SXSC |
No items available.