|
 |
|
 |
 |
Introduction to Distributed Algorithms
|
(Paperback - Oct. 16, 2000)
by Gerard Tel
Sales Rank: 530241
|
List Price: $84.00
$70.73
At Amazon

|
|
Paperback: 608 pages
Publisher: Cambridge University Press; 2 edition February 15, 2001
Language: English
ISBN-10: 0521794838
ISBN-13: 978-0521794831
Product Dimensions:
9.6 x 7.4 x 1.7 inches
Shipping Weight: 2.8 pounds
Review
"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 textbookI recommend this book for readers who are interested in a theoretical view of distributed control algorithms." IEEE Parallel & Distributed Technology
Customer Reviews & Comments Gerard Tel's is easily the best compilation of distributed computing algorithms existing. First the contents: I found its coverage to be excellent, broad yet deep coverage on network algorithms and protocols for communication, routing, deadlock-free packet switching, election, termination, global snapshot, sychronization, authenticating, self-stabilization, failure detection, wave, traversal, deadlock detection, fault tolerance, consensus, sense of direction and orientation, etc. It terms of breadth of coverage no existing book compares to this book. In particular it covers more recent areas like sense of direction and orientation and wave algorithms missed by its main competitor Nancy Lynch's Distributed Algorithms. It uses very intuitive pseudocode and the algorthimic analysis and proofs are quite intuitive and easier to understand. My complaints: The coverage in a few areas like consensus are not nearly as comprehensive as Nancy Lynch's. Also, Tel covers algorithms for asynchronous systems mostly and synchronous systems, but Nancy Lynch covers partially synchronous systems as well. I recommend Gerard Tel's book which costs less and has a deeper and broader topic coverage. For balance you need both books if you can afford them (and indeed Vijay Garg's Elemenets of Distributed Computing as well). Vijay Garg's new book - Concurrent and Distributed Computing in Java would be the best for you if your focus is distributed software development as opposed to algorithmic computing. For coverage of distributed systems principles, design and architecture I recommend one of the 3 'Distributed Systems' books by Courolis OR Andrew Tanenbaum OR Sape Mullender.
|
Introduction to Distributed Algorithms
List Price: $84.00
Available from Amazon
Price: $70.73

| |
|
|
|
|