| 000 | 03706nam a22004215i 4500 | ||
|---|---|---|---|
| 999 |
_c387302 _d387302 |
||
| 001 | 387302 | ||
| 003 | ES-MaUEC | ||
| 005 | 20230312121050.0 | ||
| 006 | a||||fo|||| 00| 0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2010 sz | s |||| 0|eng d | ||
| 020 | _a9783031020001 | ||
| 024 | 7 |
_a10.1007/978-3-031-02000-1 _2doi |
|
| 040 |
_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC |
||
| 050 | 4 |
_aQA76.9.D5 _b2010 EB |
|
| 100 | 1 |
_aRaynal, M. _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687257 _q(Michel) |
|
| 245 | 1 | 0 |
_aCommunication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems _cby Michel Raynal |
| 250 | _a1st edition 2010 | ||
| 264 | 1 |
_aCham _bSpringer International Publishing _c2010 |
|
| 300 | _a1 recurso en línea (XXII, 251 páginas) | ||
| 336 |
_atexto _btxt _2rdacontent |
||
| 337 |
_aelectrónico _bc _2rdamedia |
||
| 338 |
_arecurso electrónico _bcr _2rdacarrier |
||
| 347 |
_aarchivo de texto _bPDF |
||
| 490 | 0 |
_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. | ||
| 988 | _aSynthesis Collection of Technology_2010 | ||
| 650 | 7 |
_2embne _9141180 _aProceso de datos |
|
| 650 | 7 |
_2embne _9156434 _aProceso distribuido (Informática) |
|
| 650 | 7 |
_2embne _9668452 _aTolerancia a los fallos (Informática) |
|
| 776 | 0 | 8 |
_iPrinted edition: _z9783031008726 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031031281 |
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02000-1 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 942 |
_2lcc _cLE |
||
| 998 |
_b03/2023 _dz _esc _zSI |
||