| 書目名稱 | Quorum Systems | | 副標題 | With Applications to | | 編輯 | Marko Vukoli? | | 視頻video | http://file.papertrans.cn/783/782028/782028.mp4 | | 叢書名稱 | Synthesis Lectures on Distributed Computing Theory | | 圖書封面 |  | | 描述 | 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 | | 出版日期 | Book 2012 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-02007-0 | | isbn_softcover | 978-3-031-00879-5 | | isbn_ebook | 978-3-031-02007-0Series ISSN 2155-1626 Series E-ISSN 2155-1634 | | issn_series | 2155-1626 | | copyright | Springer Nature Switzerland AG 2012 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-5 02:18
發(fā)表于 2025-3-21 17:13:54
