| Description |
xx, 423 pages : illustrations ; 25 cm |
| Contents |
1. Introduction -- 2. Model of a Computation -- 3. Logical Clocks -- 4. Verifying Clock Algorithms -- 5. Clocks of Different Dimensions -- 6. Mutual Exclusion: Using Timestamps -- 7. Mutual Exclusion: Tokens and Quorums -- 8. Drinking Philosophers Problem -- 9. Leader Election -- 10. Global State -- 11. Observing Global Predicates -- 12. Observing Conjunctive Predicates -- 13. Channel Predicates -- 14. Termination Detection -- 15. Control of a Distributed Computation -- 16. Causal Message Ordering -- 17. Synchronous and Total Order -- 18. Computation of a Global Function -- 19. Repeated Global Computation -- 20. Synchronizers -- 21. Slicers -- 22. Distributed Shared Memory -- 23. Self-Stabilization -- 24. Knowledge and Common Knowledge -- 25. Consensus Under Asynchrony -- 26. Consensus Under Synchrony -- 27. Failure Detectors -- 28. Solvable Problems in Asynchronous Systems -- 29. Checkpointing for Recovery -- 30. Message Logging for Recovery -- A. Partial Order |
| Notes |
Bibliiography: p.403-419. - Includes index |
| Bibliography |
Bibliiography: pages 403-419. - Includes index |
| Subject |
Computer networks.
|
|
Electronic data processing -- Distributed processing.
|
| LC no. |
2002514133 |
| ISBN |
0471036005 |
|
