作者：NancyA.Lynch
出版社：MorganKaufmann
出版年：1996-3-15
页数：904
定价：USD155.00
装帧：Hardcover
ISBN：9781558603486
内容简介 ······
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.
评论 ······
理论经典。很多地方要自己手动推导一遍才能彻底理解。断断续续读了四个月，基本读完，感觉最大收获就是对于分布式的基础理论讲起来更有底气了。
另外读完这本书，再去读各种分布式理论的paper更加得心应手了，有一些以前没太看懂的东西再看起来简直是小儿科……
偏向理论的一本经典教材
虽说Lynch阿姨叙述偶尔有点混乱，但好歹强调算法的直观意义，适合不熟悉分布算法的程序员入门
逻辑清晰，证明严谨易懂。只读完了大概五六章的内容，收获良多，也帮我把一些比较散乱的知识串了起来
