Communication and agreement abstractions for fault-tolerant asynchronous distributed systems /
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 syst...
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cham, Switzerland :
Springer,
©2010
|
| Series: | Synthesis lectures on distributed computing theory ;
#2 |
| Subjects: |
Table of Contents:
- Part 1. The Register Abstraction
- 1. The Atomic Register Abstraction
- The Register Abstraction
- Concurrent Objects and Registers
- Regular Register
- Atomic Registers
- A Formal Approach to Atomicity
- Processes, Operations and Events
- Histories
- Atomicity
- Atomicity is a Local Property
- Bibliographic Notes
- 2. Implementing an Atomic Register in a Crash-Prone Asynchronous System
- The Underlying System Model
- Building an MWMR Atomic Register in ASn, t [t <n/2]
- Problem Specification
- Implementing a 1WMR Regular Register in ASn, t [t <n/2]
- From Regularity to Atomicity
- From a 1WMR Atomic Register to an MWMR Atomic Register
- Correctness Proof of the MWMR Atomic Register Construction
- An Impossibility Theorem
- The Failure Detector Approach to Circumvent Impossibilities
- What a Failure Detector Is
- Formal Definitions
- The class [sigma] of quorum failure detectors
- A [sigma]-based Algorithm That Builds a 1W1R Atomic Register
- [Sigma] Is the Weakest Failure Detector Class to Build an Atomic Register
- What Does "Weakest Failure Detector Class" Mean
- The Extraction Algorithm
- Proof of Correctness
- Bibliographic Notes