Introduction to Distributed Algorithms - Gerard Tel

Introduction to Distributed Algorithms

(Autor)

Buch | Softcover
612 Seiten
2000 | 2nd Revised edition
Cambridge University Press (Verlag)
978-0-521-79483-1 (ISBN)
74,95 inkl. MwSt
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 courses. The two new chapters on sense of direction and failure detectors will provide an entry to these still-developing topics.
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.

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.

Erscheint lt. Verlag 28.9.2000
Verlagsort Cambridge
Sprache englisch
Maße 191 x 244 mm
Gewicht 1228 g
Themenwelt Mathematik / Informatik Informatik Netzwerke
Mathematik / Informatik Informatik Theorie / Studium
ISBN-10 0-521-79483-8 / 0521794838
ISBN-13 978-0-521-79483-1 / 9780521794831
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Wie bewerten Sie den Artikel?
Bitte geben Sie Ihre Bewertung ein:
Bitte geben Sie Daten ein:
Mehr entdecken
aus dem Bereich