Introduction to Distributed Algorithms

Introduction to Distributed Algorithms

3.73 (15 ratings by Goodreads)
By (author) 

List price: US$499.99

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

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.show more

Product details

  • Online resource
  • Cambridge University Press (Virtual Publishing)
  • Cambridge, United Kingdom
  • English
  • Revised
  • 2nd Revised edition
  • 113916872X
  • 9781139168724

Review quote

"...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 Technologyshow more

Table of contents

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.show more

Rating details

15 ratings
3.73 out of 5 stars
5 27% (4)
4 40% (6)
3 13% (2)
2 20% (3)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X