|
|
|
|
LEADER |
01649nam a2200205 a 4500 |
001 |
498475 |
005 |
20171111225926.0 |
008 |
960322s1996 caua b 001 0 eng d |
020 |
|
|
|a 1558603484
|
050 |
1 |
4 |
|a QA76.9.D5
|b L96 1996
|
100 |
1 |
4 |
|a Lynch, Nancy A.
|d 1948-
|q (Nancy Ann),
|
245 |
1 |
4 |
|a Distributed algorithms /
|c Nancy A. Lynch.
|
260 |
1 |
4 |
|a San Francisco, Calif. :
|b Morgan Kaufmann Publishers,
|c c1996.
|
300 |
1 |
4 |
|a xxiii, 872 p. :
|b ill. ;
|c 25 cm.
|
504 |
1 |
4 |
|a Includes bibliographical references and index.
|
505 |
2 |
4 |
|a 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.
|
650 |
2 |
4 |
|a Electronic data processing
|x Distributed processing
|
650 |
2 |
4 |
|a Computer algorithms
|
650 |
2 |
4 |
|a Algorithms
|
952 |
|
|
|a GrThPMO
|b 59afe2246c5ad17d7e59f486
|c 952a
|d 9528
|e QA76.9.D5L96 1996
|t 14
|x m
|z Books
|