Introduction to Distributed Algorithms

Tel, Gerard

ISBN 10: 0521470692 / ISBN 13: 9780521470698

Published by Cambridge University Press, 1995

About this Item

No dust jacket. Good hardcover with some shelfwear; may have previous owner's name inside. Standard-sized.

Seller Inventory # mon0000028282

Bibliographic Details

• Title: Introduction to Distributed Algorithms
• Publisher: Cambridge University Press
• Publication Date: 1995
• Language: English
• ISBN 10: 0521470692
• ISBN 13: 9780521470698
• Binding: Hardcover
• Condition: Good

About this title

Synopsis

The lower cost and increased flexibility and availability of computer networks means that they are rapidly replacing centralized 'mainframes'. The implementation of networked systems and the control of applications running in them require, however, the design of new techniques and methods: collectively known as distributed algorithms. In this textbook Professor Tel provides a clear, yet rigorous introduction to a large collection of these methods and the related theory that has been developed over the last fifteen years. He concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks (i.e. routing, data transmission, connection management and techniques for avoiding deadlock). 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 (possibility or otherwise in asynchronous systems, consensus in synchronous systems, authentication, synchronization and stabilizing algorithms). Developed from lectures given to undergraduate and graduate students, this textbook comes complete with examples and exercises with solutions, but the treatment of algorithms is deep enough to ensure that it will be useful for practising engineers and scientists.

Review

"In all cases, the book provides an excellent overview of available techniques and a rich presentation that gives the reader an understanding of how and why the algorithms achieve their result and how to modify and implement them if necessary....This is a good collection of material to have in the library." J. Slater, Computing Reviews "Not only a reference but a text....Recommended." R.J. Wernick, Choice "Tel describes and analyzes the algorithms well; he includes complexity results and always emphasizes the importance of the underlying computational model. Moreover, each chapter ends with a very interesting list of exercises and small projects (that are sometimes open research problems)....a nice textbook for a course on the theory of distributed algorithms....I recommend this book for readers who are interested in a theoretical view of distributed control algorithms." Michel Raynal, IEEE Parallel & Distributed Technology