|
|
|
|
| LEADER |
01979nam a2200313a 44500 |
| 001 |
UBP13786 |
| 003 |
AR-CdUBP |
| 005 |
20220310161007.0 |
| 008 |
101222s1997 us a g 001 eng d |
| 020 |
|
|
|a -13: 978-1-55860-348-6
|
| 040 |
|
|
|a AR-CdUBP
|b spa
|
| 041 |
|
|
|a eng
|
| 100 |
|
|
|a Lynch, Nancy A.
|
| 245 |
1 |
0 |
|a Distributed algorithms /
|c Nancy A. Lynch.
|
| 260 |
|
|
|a San Francisco, California :
|b Morgan Kaufmann,
|c 1997.
|
| 300 |
|
|
|a xxiii, 872 p. ;
|c 24 cm.
|
| 490 |
|
|
|a The Morgan Kauffmann series in data management systems /
|c Jim Gray, ed.
|
| 504 |
|
|
|a Bibliografía: p. 839-856.
|
| 505 |
0 |
|
|a 1. Introduction. Part. Synchronous network algorithms. 2. Modelling I: synchronous network model. 3. Leader election in a synchronous ring. 4. Algorithms in general synchronous networks. 5. Distributed consensus with link failures. 6. Distributed consensus process failures. 7. More consensus problems. Part II. Asynchronous algorithms. 8. Modelling II: asynchronous system model. Part IIA. Asynchronous shared memory algorithms. 9. Modelling III: asynchronous shared memory model. 10. Mutual exclusion. 11. Resource allocation. 12. Consensus. 13. Atomic objects. Part IIB. Asynchronous network algorithms. 14. Modelling IV: asynchronous network model. 15. Basic asynchronous network algorithms. 16. Synchronizers. 17. Shared memory versus networks. 18. Logical time. 19. Global snapshots and stable properties. 20. Network resource allocation. 21. Asynchronous networks with process failures. 22. Data link protocols. Part III. Partially synchronous algorithms. 23. Partially synchronous system models. 24. Mutual exclusion with partial synchrony. 25. Consensus with partial synchrony. Bibliography. Index.
|
| 650 |
|
4 |
|a ALGORITMOS
|
| 650 |
|
4 |
|a ESTRUCTURA DE DATOS
|
| 653 |
|
|
|a INFORMATICA
|
| 800 |
|
|
|a Gray, Jim,
|e ed.
|
| 930 |
|
|
|a INFORMATICA
|
| 931 |
|
|
|a 13786
|b UBP
|
| 942 |
|
|
|2 cdu
|c BK
|
| 945 |
|
|
|a NNM
|
| 984 |
|
|
|a 004.421
|b L991
|
| 999 |
|
|
|c 28791
|d 28791
|