- Hardcover: 904 pages
- Publisher: Morgan Kaufmann Publishers In (16 April 1996)
- Language English
- ISBN-10: 1558603484
- ISBN-13: 978-1558603486
- Product Dimensions: 24.2 x 19.6 x 4.6 cm
- Average Customer Review: 4.8 out of 5 stars See all reviews (4 customer reviews)
- Amazon Bestsellers Rank: 297,192 in Books (See Top 100 in Books)
- See Complete Table of Contents
Distributed Algorithms
and over one million other books are available for Amazon Kindle .
Learn more
| ||||||||||||||||||||
 Trade In this Item for up to £40.85
Get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade in Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) for an Amazon.co.uk gift card of up to £40.85, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
Product details |
More About the Author
Product Description
Product Description
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.
Inside This Book
(Learn More)
First Sentence
This is the shortest chapter in the book. Read the first page
Front Cover | Copyright | Table of Contents | Excerpt | Index
This is the shortest chapter in the book. Read the first page
Explore More
Concordance
Browse Sample PagesConcordance
Front Cover | Copyright | Table of Contents | Excerpt | Index
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
Most Helpful Customer Reviews
2 of 2 people found the following review helpful
Format:Hardcover
This book is in the same class as "Discrete mathematics" by Knuth and others. Important topic, extensive coverage, good English, zero vendor's propaganda. Super. An unexpected gift from up above (after struggling with reams of MS's (dis) information <g>.) I am working on something distributed and ran into this book accidentally, while browsing in a bookstore--I'm glad I did. Btw, it's a few bucks cheaper in B&N store (here goes my review <g>.)
1 of 1 people found the following review helpful
Format:Hardcover
I finally found a very nice compendium of concisely described distributed algorithms. The book is highly readable and I look forward to more books from the author. If you work with distributed systems or software problems, buy this book!
Format:Hardcover
I know it seems expensive. Really it's a bargain.
If you are interested in distributed and parallel computing then you owe it to yourself to own this.
This book is a computer science classic.
Un-put-downable!
A pure pleasure.
If you are interested in distributed and parallel computing then you owe it to yourself to own this.
This book is a computer science classic.
Un-put-downable!
A pure pleasure.
Would you like to see more reviews about this item?
Were these reviews helpful?
Let us know
Listmania!
Look for similar items by category
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
