Cargando…
Introduction to distributed algorithms /
The second edition of this successful textbook provides an up-to-date introduction both to distributed algorithms and to the theory behind them. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful fo...
| Clasificación: | QA76.9 A4.3 T4.43 2000 |
|---|---|
| Autor principal: | |
| Formato: | Libro |
| Idioma: | Inglés |
| Publicado: |
Cambridge [England] : New York :
Cambridge University Press,
2000.
|
| Edición: | Segunda edición |
| Temas: |
MARC
| LEADER | 00000aam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | 000162354 | ||
| 005 | 20180904020441.0 | ||
| 007 | ta | ||
| 008 | 000323s2000 enka f 001 0 eng d | ||
| 020 | |a 0521794838 | ||
| 020 | |a 9780521794831 | ||
| 020 | |a 9780521605670 | ||
| 040 | |a DLC |b spa |e rda |c DLC |d DHA |d OCLCQ |d MX-MxUAM | ||
| 041 | 0 | |a eng | |
| 050 | 4 | |a QA76.9 A4.3 |b T4.43 2000 | |
| 090 | |a QA76.9 A4.3 |b T4.43 2000 | ||
| 100 | 1 | |a Tel, Gerard, |e autor | |
| 245 | 1 | 0 | |a Introduction to distributed algorithms / |c Gerard Tel. |
| 250 | |a Segunda edición | ||
| 264 | 1 | |a Cambridge [England] : |a New York : |b Cambridge University Press, |c 2000. | |
| 300 | |a xii, 596 páginas ; |c 25 cm. | ||
| 336 | |a texto |b txt |2 rdacontent | ||
| 337 | |a sin medio |b n |2 rdamedia | ||
| 338 | |a volumen |b nc |2 rdacarrier | ||
| 504 | |a Incluye referencias bibliográficas: páginas 572-586 e índice. | ||
| 505 | 2 | 0 | |g 1. |t Introduction: Distributed Systems. -- |g Part one: |t Protocols. -- |g 2. |t Model |g 3. |t Communication Protocols. -- |g 4. |t Routing Algorithms. -- |g 5. |t Deadlock-free Packet Switching. -- |g Part two: |t fundamental algorithms. -- |g 6. |t Wave and Traversal Algorithms. -- |g 7. |t Election Algorithms. -- |g 8. |t Termination Detection. -- |g 9. |t Anonymous Networks. |g 10. |t Snapshots. -- |g 11. |t Sense of dorection and oientation. -- |g 12. |t Synchrony in networks. -- |g Part three: |t Fault tolerance. -- |g 13. |t Fault tolerance in distribuited systems. -- |g 14. |t Fault tolerance in asynchronous systems. -- |g 15. |t Fault tolerance in synchronous sstems. -- |g 16. |t Failure detection. -- |g 17. |t Stabilization. |
| 520 | 1 | |a The second edition of this successful textbook provides an up-to-date introduction both to distributed algorithms and to the theory behind them. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful for practicing engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model and includes algorithms for the implementation of computer communication networks. Two new chapters on sense of direction and failure detectors are state of the art and will provide an entry to research in these still-developing topics. Comprehensive overview of distributed algorithms and related theory and methods Use of uniform model of computing and uniform programming notation throughout with treatment of wave algorithms as an algorithmic building block Many exercises with teachers' solutions available, plus clear and rigorous presentation makes it ideal for courses on distributed systems and algorithms. | |
| 650 | 4 | |a Algoritmos | |
| 650 | 0 | |a Algorithms | |
| 650 | 4 | |a Redes de información | |
| 650 | 0 | |a Information networks | |
| 905 | |a LIBROS | ||
| 938 | |a Comunidad |c CBS | ||
| 949 | |a Biblioteca UAM Iztapalapa |b Colección General |c QA76.9 A4.3 T4.43 2000 | ||