Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)
Language: English
Published by Morgan Kaufmann, 1996
Series: Book 5 of 52 - The Morgan Kaufmann Series in Data Management Systems
- Hardcover
- Used

Seller: Dream Books Co., Denver, CO, U.S.A.Dream Books Co.
AbeBooks seller since November 23, 2023
Condition: Used - Good
US$ 31.20
Quantity: 1 available
Add to basketItem description from seller
Seller Inventory # DBV.1558603484.G
- Title
- Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)
- Author
- Lynch, Nancy A.
- Publisher
- Morgan Kaufmann
- Publication year
- 1996
- Condition
- good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 1558603484
- ISBN 13
- 9781558603486
- Series
- Book 5 of 52: The Morgan Kaufmann Series in Data Management Systems
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.
"Synopsis" may belong to another edition of this title.
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 the title" may belong to another edition of this title.
Dream Books Co.
Denver, CO, U.S.A.
AbeBooks seller since November 23, 2023
Shipping rates within U.S.A.
| Item | 3 to 8 business days | 2 to 5 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 1.99 |
Payment methods
Store description
Specialty
All types of used books.Terms of sale
We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a
book that you've ordered, please use the Ask bookseller a question link to contact
us and we'll respond within 2 business days.
Shipping terms
International packages exceeding 3 lbs may require additional postage.