Wiley series on parallel and distributed computing
Includes bibliographical references (pages 381-400) and index
1. 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
0
Distributed computing.
Electronic data processing-- Distributed processing