Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach (Paperback)

Part I: Introductory : Chapter: a Few Definitions and Two Examples.- Part II : I The Reliable Broadcast Communication Abstraction.- Reliable Broadcast in the Presence of Process Crash Failures.- Reliable Broadcast in the Presence of Process Crashes and Unreliable Channels.- Reliable Broadcast in the Presence of Byzantine Processes.- Part III : The Read/Write Register Communication Abstraction.- The Read/Write Register Abstraction.- Building Read/Write Registers Despite Asynchrony and Less Than Half of Processes Crash (t < n/2).- Circumventing the t < n/2 Read/Write Register Impossibility: the Failure Detector Approach.- A Broadcast Abstraction Suited to the Family of Read/Write Implementable Objects.- Atomic Read/Write Registers in the Presence of Byzantine Processes.- Part IV: Agreement in Synchronous Systems.- Consensus and Interactive Consistency in Synchronous Systems Prone to Process Crash Failures.- Expedite Decision in Synchronous Systems with Process Crash Failures.- Consensus Variants: Simultaneous Consensus and k-Set Agreement.- Non-blocking Atomic Commit in Synchronous Systems with Process Crash Failures.- Consensus in Synchronous Systems Prone to Byzantine Process Failures.- Part V: Agreement in Asynchronous Systems.- Implementable Agreement Abstractions Despite Asynchrony and a Minority of Process Crashes.- Consensus: Power and Implementability Limit in Crash-Prone Asynchronous Systems.- Implementing Consensus in Enriched Crash-Prone Asynchronous Systems.- Implementing Oracles in Asynchronous Systems with Process Crash Failures.- Implementing Consensus in Enriched Byzantine Asynchronous Systems.-Part VI : Appendix - Bibliography.-  Index.