Description
Book SynopsisDivided into three parts, this work provides an introduction to the theory of distributed computing. It covers the fundamental models, issues, and techniques. It is organized around key simulations in distributed computing, and their applications.
Trade Review"This is a second edition of a well-received graduate course textbook dealing with the important field of distributed computing." (
Computing Reviews.com, May 10, 2006)
"...the authors take readers through these notoriously difficult subjects and ably demystify puzzling buzzwords…" (IEEE Distributed Systems Online, March 2005)
"The authors present the fundamental issues underlying the design of distributed systems…as well as fundamental algorithmic concepts and lower-bound techniques." (IEEE Computer Magazine, October 2004)
Table of Contents1. Introduction.
PART I: FUNDAMENTALS.
2. Basic Algorithms in Message-Passing Systems.
3. Leader Election in Rings.
4. Mutual Exclusion in Shared Memory.
5. Fault-Tolerant Consensus.
6. Causality and Time.
PART II: SIMULATIONS.
7. A Formal Model for Simulations.
8. Broadcast and Multicast.
9. Distributed Shared Memory.
10. Fault-Tolerant Simulations of Read/Write Objects.
11. Simulating Synchrony.
12. Improving the Fault Tolerance of Algorithms.
13. Fault-Tolerant Clock Synchronization.
PART III: ADVANCED TOPICS.
14. Randomization.
15. Wait-Free Simulations of Arbitrary Objects.
16. Problems Solvable in Asynchronous Systems.
17. Solving Consensus in Eventually Stable Systems.
References.
Index.
