Introduction to Distributed Algorithms

You looking to find the "Introduction to Distributed Algorithms" Good news! You can purchase Introduction to Distributed Algorithms with secure price and compare to view update price on this product. And deals on this product is available only for limited time.

   

Product 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.

Introduction to Distributed Algorithms Review

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. Help other customers find the most helpful reviews Was this review helpful to you? Yes No Report abuse | PermalinkComment�Comment (1)

Most of the consumer Reviews tell that the "Introduction to Distributed Algorithms" are high quality item. You can read each testimony from consumers to find out cons and pros from Introduction to Distributed Algorithms ...