Raynal, Michel.
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems [electronic resource] / by Michel Raynal. - 1st ed. 2010. - XXII, 251 p. online resource. - Synthesis Lectures on Distributed Computing Theory, 2155-1634 . - Synthesis Lectures on Distributed Computing Theory, .
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.
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. 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.
9783031020001
10.1007/978-3-031-02000-1 doi
Computer science.
Coding theory.
Information theory.
Data structures (Computer science).
Computer Science.
Coding and Information Theory.
Data Structures and Information Theory.
QA75.5-76.95
004
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems [electronic resource] / by Michel Raynal. - 1st ed. 2010. - XXII, 251 p. online resource. - Synthesis Lectures on Distributed Computing Theory, 2155-1634 . - Synthesis Lectures on Distributed Computing Theory, .
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.
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. 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.
9783031020001
10.1007/978-3-031-02000-1 doi
Computer science.
Coding theory.
Information theory.
Data structures (Computer science).
Computer Science.
Coding and Information Theory.
Data Structures and Information Theory.
QA75.5-76.95
004