Distributed Algorithms - The Morgan Kaufmann Series in Data Management Systems (Hardback)
  • Distributed Algorithms - The Morgan Kaufmann Series in Data Management Systems (Hardback)
zoom

Distributed Algorithms - The Morgan Kaufmann Series in Data Management Systems (Hardback)

(author)
£115.00
Hardback 904 Pages / Published: 16/04/1996
  • We can order this from the publisher

Usually dispatched within 15 working days

  • This item has been added to your basket
In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model-first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.

Publisher: Elsevier Science & Technology
ISBN: 9781558603486
Number of pages: 904
Weight: 1637 g
Dimensions: 241 x 192 x 46 mm

You may also be interested in...

Discrete Mathematics for Computing
Added to basket
Foundation Mathematics
Added to basket
The Algorithm Design Manual
Added to basket
An Introduction to Substructural Logics
Added to basket
The Elements of Statistical Learning
Added to basket
Discrete Mathematics
Added to basket
Bayesian Methods for Hackers
Added to basket
Algorithms
Added to basket
£121.99
Paperback
Validated Numerics
Added to basket
Basic Simple Type Theory
Added to basket
Logic in Computer Science
Added to basket
Quantum Computer Science
Added to basket
Art of Computer Programming, The
Added to basket
Data Analysis with Open Source Tools
Added to basket
The Essential Turing
Added to basket

Please sign in to write a review

Your review has been submitted successfully.