Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach
by: Michel Raynal
ISBN-10: 3319941402
ISBN-13: 9783319941400
Edition 版次: 1st ed. 2018
Publication Date 出版日期: 2018-09-08
Print Length 页数: 459
Book Description
By finelybook
This book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms,in particular in terms of reliable communication and agreement,which lie at the heart of nearly all distributed applications. These programming abstractions,distributed objects or services,allow software designers and programmers to cope with asynchrony and the most important types of failures such as process crashes,message losses,and malicious behaviors of computing entities,widely known under the term “Byzantine fault-tolerance”. The author introduces these notions in an incremental manner,starting from a clear specification,followed by algorithms which are first described intuitively and then proved correct.
The book also presents impossibility results in classic distributed computing models,along with strategies,mainly failure detectors and randomization,that allow us to enrich these models. In this sense,the book constitutes an introduction to the science of distributed computing,with applications in all domains of distributed systems,such as cloud computing and blockchains. Each chapter comes with exercises and bibliographic notes to help the reader approach,understand,and master the fascinating field of fault-tolerant distributed computing.
Contents
Notation
Figures &Algorithms
Tables
1Definitions & Introductory Examples
–Reliable Broadcast Communication Abstraction
2In Presence of Process Crash Failures
3 In Presence of Process Crashes & Unreliable Channels
4 In Presence of Byzantine Processes
–R/W Register Communication Abstraction
5R/W Register Abstraction
6R/W Registers despite Asynchrony &t<n/2
7 Circumventing t< n/2 R/W Register Impossibility-Failure Detector Approach
8 Broadcast Abstraction suited to Family of R/W Implementable Objects
9 Atomic R/W Registers in Presence of Byzantine Processes
–Agreement in Sync Systems
10Consensus &Interactive Consistency in Sync Systems prone to Process Crash
Failures
11Expediting Decision in Sync Systems prone to Process Crash Failures
12 Consensus Variants-Simultaneous Consensus & k-Set Agreement
13Non-Blocking Atomic Commitment in Presence of Process Crash Failures
14 Consensus in Sync Systems prone to Byzantine Process Failures
–Agreement in Async Systems
15Implementable Agreement Abstractions despite Asynchrony & Minority of
Process Crashes
16 Consensus-Power & Implementability Limit in Crash-prone Async Systems
17 Implementing Consensus in Enriched Crash-prone Async Systems
18 Implementing Oracles in Async Systems prone to Process Crash Failures
19 Implementing Consensus in Enriched Byzantine Async Systems
20Quorum,Signatures & Overlays
