Cantitate/Preț
Produs

Introduction to Distributed Algorithms

Autor Gerard Tel
en Limba Engleză Paperback – 27 sep 2000
Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising 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. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The 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.
Citește tot Restrânge

Preț: 54371 lei

Preț vechi: 67964 lei
-20% Nou

Puncte Express: 816

Preț estimativ în valută:
10405 10771$ 8795£

Carte tipărită la comandă

Livrare economică 05-19 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521794831
ISBN-10: 0521794838
Pagini: 612
Dimensiuni: 191 x 244 x 33 mm
Greutate: 1.09 kg
Ediția:Revizuită
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom

Cuprins

Preface; 1. Introduction: distributed systems; Part I. Protocols: 2. The model; 3. Communication protocols; 4. Routing algorithms; 5. Deadlock-free packet switching; Part II. Fundamental Algorithms: 6. Wave and traversal algorithms; 7. Election algorithms; 8. Termination detection; 9. Anonymous networks; 10. Snapshots; 11. Sense of direction and orientation; 12. Synchrony in networks; Part III. Fault Tolerance: 13. Fault tolerance in distributed systems; 14. Fault tolerance in asynchronous systems; 15. Fault tolerance in synchronous systems; 16. Failure detection; 17. Stabilization; Part IV. Appendix A: pseudocode conventions; Appendix B: graphs and networks; References; Index.

Recenzii

"...an excellent overview of available techniques." Computing Reviews
"The book provides an up-to-date introduction to both distributed algorithms, and to the theory behind these algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful for practising engineers and researchers." Mathematical Reviews
"Provides a very decent interesting to significant topics of the theory of Distributed Computing, and it is especially suitable as both a reference book and a textbook." SIGACT News
"...a nice textbook...I recommend this book for readers who are interested in a theoretical view of distributed control algorithms." IEEE Parallel & Distributed Technology

Descriere

The second edition of this successful textbook provides an up-to-date introduction both to distributed algorithms and to the theory behind them.