Distributed algorithms /
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
San Francisco, Calif. :
Morgan Kaufmann Publishers,
c1996.
|
| Subjects: |
Table of Contents:
- 1. Introduction
- 2. Modelling I: Synchronous Network Model
- 3.Leader Election in a Synchronous Ring
- 4. Algorithms in GeneralSynchronous Networks
- 5. Distributed Consensus with Link Failures
- 6. Distributed Consensus with Process Failures
- 7. More ConsensusProblems
- 8. Modelling II: Asynchronous System Model
- 9. ModellingIII: Asynchronous Shared Memory Model
- 10. Mutual Exclusion
- 11.Resource Allocation
- 12. Consensus
- 13. Atomic Objects
- 14.Modelling IV: Asynchronous Network Model
- 15. Basic AsynchronousNetwork Algorithms
- 16. Synchronizers
- 17. Shared Memory versusNetworks
- 18. Logical Time
- 19. Global Snapshots and StableProperties
- 20. Network Resource Allocation
- 21. AsynchronousNetworks with Process Failures
- 22. Data Link Protocols
- 23.Partially Synchronous System Models
- 24. Mutual Exclusion withPartial Synchrony
- 25. Consensus with Partial Synchrony.