## Distributed AlgorithmsIn
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. |

### What people are saying - Write a review

Must have for everyone that wants to learn the theory of distributed computing.

I ENJOYED THIS THOROUGHLY

### Contents

1 | |

15 | |

Asynchronous Algorithms | 197 |

Asynchronous Shared Memory Algorithms | 235 |

Asynchronous Network Algorithms | 455 |