| 書目名稱 | Fault-tolerant Agreement in Synchronous Message-passing Systems | | 編輯 | Michel Raynal | | 視頻video | http://file.papertrans.cn/342/341512/341512.mp4 | | 叢書名稱 | Synthesis Lectures on Distributed Computing Theory | | 圖書封面 |  | | 描述 | Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. A previous book Communication and Agreement Abstraction for Fault-tolerant Asynchronous Distributed Systems (published by Morgan & Claypool, 2010) was devoted to the problems created by crash failures in asynchronous message-passing systems. The present book focuses on the way to cope with the uncertainty created by process failures (crash, omission failures and Byzantine behavior) in synchronous message-passing systems (i.e., systems whose progress is governed by the passage of time). To that end, the book considers fundamental problems that distributed synchronous processes have to solve. These fundamental problems concern agreement among processes (if processes are unable to agree in one way or another in presence of failures, no non-trivial problem can be solved). They are consensus, interactiveconsistency, k-set agreement and non-blocking atomic commit. Being able to solve these basic problems efficiently with provable guarantees allows applications designers to give a precise meaning to the wor | | 出版日期 | Book 2010 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-02001-8 | | isbn_softcover | 978-3-031-00873-3 | | isbn_ebook | 978-3-031-02001-8Series ISSN 2155-1626 Series E-ISSN 2155-1634 | | issn_series | 2155-1626 | | copyright | Springer Nature Switzerland AG 2010 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 01:11
發(fā)表于 2025-3-21 18:35:36
