000 04380nam a22005175i 4500
001 978-3-031-02001-8
003 DE-He213
005 20240730163751.0
007 cr nn 008mamaa
008 220601s2010 sz | s |||| 0|eng d
020 _a9783031020018
_9978-3-031-02001-8
024 7 _a10.1007/978-3-031-02001-8
_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 _aRaynal, Michel.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980467
245 1 0 _aFault-tolerant Agreement in Synchronous Message-passing Systems
_h[electronic resource] /
_cby Michel Raynal.
250 _a1st ed. 2010.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2010.
300 _aXXI, 167 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 _aList of Figures -- Synchronous Model, Failure Models, and Agreement Problems -- Consensus and Interactive Consistency in the Crash Failure Model -- Expedite Decision in the Crash Failure Model -- Simultaneous Consensus Despite Crash Failures -- From Consensus to k-Set Agreement -- Non-Blocking Atomic Commit in Presence of Crash Failures -- k-Set Agreement Despite Omission Failures -- Consensus Despite Byzantine Failures -- Byzantine Consensus in Enriched Models.
520 _aUnderstanding 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 words ""cooperate"" and ""agree"" despite failures, and write distributed synchronous programs with properties that can be stated and proved. Hence, the aim of the book is to present a comprehensive view of agreement problems, algorithms that solve them and associated computability bounds in synchronous message-passing distributed systems. Table of Contents: List of Figures / Synchronous Model, Failure Models, and Agreement Problems / Consensus and Interactive Consistency in the Crash Failure Model / Expedite Decision in the Crash Failure Model / Simultaneous Consensus Despite Crash Failures / From Consensus to k-Set Agreement / Non-Blocking Atomic Commit in Presence of Crash Failures / k-Set Agreement Despite Omission Failures / Consensus Despite Byzantine Failures / Byzantine Consensusin Enriched Models.
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.
_980468
650 2 4 _aData Structures and Information Theory.
_931923
710 2 _aSpringerLink (Online service)
_980469
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031008733
776 0 8 _iPrinted edition:
_z9783031031298
830 0 _aSynthesis Lectures on Distributed Computing Theory,
_x2155-1634
_980470
856 4 0 _uhttps://doi.org/10.1007/978-3-031-02001-8
912 _aZDB-2-SXSC
942 _cEBK
999 _c84965
_d84965