Distributed Algorithms
Nancy A. Lynch, «Distributed Algorithms»
Morgan Kaufmann | ISBN: 1558603484 | 1997 | PDF | 904 pages | 38.99 MB
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.
Posts
0 comments:
Post a Comment
report broken linkhere if link is broken