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 ...
Read More
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.
Read Less
Add this copy of Distributed Algorithms to cart. $46.94, fair condition, Sold by ThriftBooks-Dallas rated 4.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1996 by Morgan Kaufmann Publishers.
Add this copy of Distributed Algorithms (the Morgan Kaufmann Series in to cart. $49.07, good condition, Sold by BooksRun rated 4.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 1996 by Morgan Kaufmann.
Add this copy of Distributed Algorithms to cart. $50.93, good condition, Sold by TextbookRush rated 4.0 out of 5 stars, ships from Grandview Hts, OH, UNITED STATES, published 1996 by Morgan Kaufmann Publishers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. All orders ship SAME or NEXT business day. Expedited shipments will be received in 1-5 business days within the United States. We proudly ship to APO/FPO addresses. 100% Satisfaction Guaranteed!
Add this copy of Distributed Algorithms (the Morgan Kaufmann Series in to cart. $63.11, fair condition, Sold by Archives Books, inc. rated 5.0 out of 5 stars, ships from Edmond, OK, UNITED STATES, published 1996 by Morgan Kaufmann.
Add this copy of Distributed Algorithms (the Morgan Kaufmann Series in to cart. $113.26, good condition, Sold by TEXTSHUB rated 5.0 out of 5 stars, ships from Franklin Lakes, NJ, UNITED STATES, published 1996 by Morgan Kaufmann.
