Fault-Tolerant Distributed Computing

A theoretician's view of fault tolerant distributed computing....Pages 1-9
A comparison of the Byzantine Agreement problem and the Transaction Commit Problem....Pages 10-17
The state machine approach: A tutorial....Pages 18-41
A simple model for agreement in distributed systems....Pages 42-50
Atomic broadcast in a real-time environment....Pages 51-71
Randomized agreement protocols....Pages 72-83
An overview of clock synchronization....Pages 84-96
Implementation issues in clock synchronization....Pages 97-107
Argus....Pages 108-114
TABS....Pages 115-123
Communication support for reliable distributed computing....Pages 124-137
Algorithms and system design in the highly available systems project....Pages 138-146
Easy impossibility proofs for distributed consensus problems....Pages 147-170
An efficient, fault-tolerant protocol for replicated data management....Pages 171-191
Arpanet routing....Pages 192-200
On the relationship between the atomic commitment and consensus problems....Pages 201-208
The August system....Pages 209-216
The sequoia system....Pages 217-223
Fault tolerance in distributed UNIX....Pages 224-243
Faults and their manifestation....Pages 244-261
The “Engineering” of fault-tolerant distributed computing systems....Pages 262-273
Bibliography for fault-tolerant distributed computing....Pages 274-298