|
|||||||||||||||||||||||||||||||||||
|
6 Reviews
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
16 of 16 people found the following review helpful:
5.0 out of 5 stars
definite reference,
By Boris Aleksandrovsky (San Francisco, CA United States) - See all my reviews
This review is from: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) (Hardcover)
Professor's Nancy Lynch's "Distributed Algorithms" is a definite reference for theoretical treatments of many hard problems in distributed computing. It is a textbook, but written in such a clear style that makes it almost a pleasure read. Rarely have I seen something like that! The book has a right proportion of theoretical proofs, practical applications, philosophical appreciation of the problems, research questions, examples and study points. "Distributed Algorithms" has 3 main parts - synchronous, asynchronous and partially synchronous network algorisms. Each part describes consensus resolution, mutual exclusion, resource allocation, leader election, termination detection and failure detection as main problems in distributed computing theory. Lynch has done a masterful job of leading us from simple to complex, from theoretically solvable to practically intractable problems. For a practitioner of computer science, who is not necessarily involved in fundamental research, this book gives a clear appreciation of problems of 2PC, resource management, failure profiles in faulty and noisy networks, optimization and fault management in distributed networks. All those things are foundations of databases, network computing and enterprise scalability. It also helped me greatly in estimating the best and worst case boundaries in certain practical distributed system optimization problems.
18 of 25 people found the following review helpful:
5.0 out of 5 stars
First class thing. I wish all I have to read were that good,
By A Customer
This review is from: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) (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>.)
6 of 8 people found the following review helpful:
5.0 out of 5 stars
Excellent study material for a practising IT engineer,
This review is from: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) (Hardcover)
Together with Mrs. Lynch's other book "Atomic Transactions", this book has been my "Bible" for years already. And now that I am starting my own company in software development, I think about making this book obligatory reading for my first new employee. Not only because of the nature of its contents, but also because of the way these are presented, and the thought-work behind it. Ideas like the provability of algorithms, seeing the user as an automaton and showing that Lamport time >>really>> works, are rare to be found together in the same textbook. This book puts research back where it belongs: before practice, not over it. Mrs. Lynch has done a great job. It is upon this work of hers, together with "Atomic Transactions", that the IOA specification language is based, created in the LCS of MIT. IOA is now in near-operational working order, and puts into application almost all of the thoughts expressed in this book.
A must-read for any software engineer who takes him-/herself seriously.
5 of 8 people found the following review helpful:
5.0 out of 5 stars
Excellent reference book for practicing software pros,
By neumille@cig.mot.com (Motorola, Arlington Heights, IL) - See all my reviews
This review is from: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) (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!
18 of 31 people found the following review helpful:
4.0 out of 5 stars
the only book of its kind,
By A Customer
This review is from: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) (Hardcover)
At MIT, I took the course 6.852 Distributed Algorithms under Professor Nancy Lynch. It was an excellence course. This books is based on her lecture notes. Before this book, there is really no book that covers these material in rigorious and consistent matter. One usually have to read the actual published academic papers. Because different author may use different notations or models, sometimes it is hard to see the whole picture. This book shows exactly that. The algorithms are presented in a consistent notation, and the models and the assumptions all the explicit, clear and consistent. However, Professor Lynch's lecture style can get really dry and boring, sometimes I can't help felling asleep because the class was so early in the morning. For that, I decided to give it only 4 stars.
0 of 40 people found the following review helpful:
1.0 out of 5 stars
Book cover was reverse and up side down,
By puneet "Puneet" (Seattle) - See all my reviews
Amazon Verified Purchase(What's this?)
This review is from: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) (Hardcover)
I received the book with the book cover upside down and reversed with respect to the book.
|
|
Most Helpful First | Newest First
|
|
Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) by Nancy A. Lynch (Hardcover - March 15, 1996)
$143.00 $108.43
In Stock | ||