Distributed Algorithms

Lynch, Nancy A.

  • 4.21 out of 5 stars
    58 ratings by Goodreads
ISBN 10: 1558603484 ISBN 13: 9781558603486
Published by Elsevier Science & Technology, 1996
Used Hardcover

From Better World Books, Mishawaka, IN, U.S.A. Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since August 3, 2006

This specific item is no longer available.

About this Item

Description:

Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP36397095

  • 4.21 out of 5 stars
    58 ratings by Goodreads

Report this item

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.

"About this title" may belong to another edition of this title.

Bibliographic Details

Title: Distributed Algorithms
Publisher: Elsevier Science & Technology
Publication Date: 1996
Binding: Hardcover
Condition: Good
Edition: 1st.

Top Search Results from the AbeBooks Marketplace

Stock Image

Lynch, Nancy A.
Published by Morgan Kaufmann, 1996
ISBN 10: 1558603484 ISBN 13: 9781558603486
Used Hardcover First Edition

Seller: Reader's Corner, Inc., Raleigh, NC, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: Fine. 1st Edition. This is a fine, unmarked, hardcover first edition, second printing copy, no DJ, brown spine, 872 pages. MEDIA SHIPPING, extra for airmail or international shipping. Seller Inventory # 107092

Contact seller

Buy Used

US$ 75.00
Convert currency
Shipping: US$ 5.50
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket