| 000 | 03907nam a22005175i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-02000-1 | ||
| 003 | DE-He213 | ||
| 005 | 20240730163750.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2010 sz | s |||| 0|eng d | ||
| 020 |
_a9783031020001 _9978-3-031-02000-1 |
||
| 024 | 7 |
_a10.1007/978-3-031-02000-1 _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 _980463 |
|
| 245 | 1 | 0 |
_aCommunication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems _h[electronic resource] / _cby Michel Raynal. |
| 250 | _a1st ed. 2010. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2010. |
|
| 300 |
_aXXII, 251 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 -- The Atomic Register Abstraction -- Implementing an Atomic Register in a Crash-Prone Asynchronous System -- The Uniform Reliable Broadcast Abstraction -- Uniform Reliable Broadcast Abstraction Despite Unreliable Channels -- The Consensus Abstraction -- Consensus Algorithms for Asynchronous Systems Enriched with Various Failure Detectors -- Constructing Failure Detectors. | |
| 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. Considering the uncertainty created by asynchrony and process crash failures in the context of message-passing systems, the book focuses on the main abstractions that one has to understand and master in order to be able to produce software with guaranteed properties. These fundamental abstractions are communication abstractions that allow the processes to communicate consistently (namely the register abstraction and the reliable broadcast abstraction), and the consensus agreement abstractions that allows them to cooperate despite failures. As they give a precise meaning to the words "communicate" and "agree" despite asynchrony and failures, these abstractions allow distributed programs to be designed with properties that can be stated and proved. Impossibility results are associated with these abstractions. Hence, in order to circumvent these impossibilities, the book relies on the failure detector approach, and, consequently, that approach to fault-tolerance is central to the book. Table of Contents: List of Figures / The Atomic Register Abstraction / Implementing an Atomic Register in a Crash-Prone Asynchronous System / The Uniform Reliable Broadcast Abstraction / Uniform Reliable Broadcast Abstraction Despite Unreliable Channels / The Consensus Abstraction / Consensus Algorithms for Asynchronous Systems Enriched with Various Failure Detectors / Constructing Failure Detectors. | ||
| 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. _980464 |
| 650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
| 710 | 2 |
_aSpringerLink (Online service) _980465 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031008726 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031031281 |
| 830 | 0 |
_aSynthesis Lectures on Distributed Computing Theory, _x2155-1634 _980466 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-02000-1 |
| 912 | _aZDB-2-SXSC | ||
| 942 | _cEBK | ||
| 999 |
_c84964 _d84964 |
||