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

Lynch, Nancy A.

ISBN 10: 1558603484 / ISBN 13: 9781558603486

Published by Morgan Kaufmann, 1996

About this Item

hardcover. Page block firm and clean, binding unblemished, boards straight, without markings of any kind. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.

Seller Inventory # BAY15-00272

Bibliographic Details

• Title: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)
• Publisher: Morgan Kaufmann
• Publication Date: 1996
• Language: English
• ISBN 10: 1558603484
• ISBN 13: 9781558603486
• Binding: Hardcover
• Condition: Very Good

About this title

Synopsis

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.

About the Author

About the author:Nancy A. Lynch is a professor of electrical engineering and computer science at MIT and heads MIT's Theory of Distributed Systems research group. She is the author of numerous research articles about distributed algorithms and impossibility results, and about formal modeling and verification of distributed systems.