Gerard Tel
Amazon Price: $67.50
List Price: $75.00
Usually ships in 24 hours
By: Cambridge University Press
Amazon Marketplace: 30
new & used starting at $62.84
|
Buy at Amazon.com
|
Browse similar items by category:
Subjects -> Business & Investing -> Industries & Professions -> MIS
Subjects -> Computers & Internet -> Business & Culture -> Manager's Guides to Computing
Subjects -> Computers & Internet -> Computer Science -> Software Engineering -> Information Systems
Customer Reviews:
Total reviews: 3
Average rating: 4.5 of 5
Simply the Best Book on Distributed Algorithms! 5 out of 5 stars.
24 of 25 people found this review helpful.
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.
Editorial Review:
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 advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful for practicing 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. 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.