Distributed AlgorithmsElsevier, 16.04.1996 - 904 Seiten 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. |
Im Buch
Ergebnisse 1-5 von 82
... lemma for our lower bound, Lemma 3.5. It says that processes that have order-equivalent k-neighborhoods behave in essentially the same way, until information has had a chance to propagate to the processes from outside the k ...
Nancy A. Lynch. Proof (of Lemma 3.5). Without loss of generality, we may assume that i # j. We proceed by induction on the number r of rounds that have been performed in the execution. For each r, we prove the lemma for all k. Basis: r ...
... Lemma 3.5 tells us that many active rounds are necessary to break symmetry if there are large order-equivalent neighborhoods. We now define particular rings with the special property that they have many order-equivalent neighborhoods of ...
... lemma. Lemma 4.3 Let G = (V, E) be a weighted undirected graph, and let {(V, E) : 1 < i < k} be any spanning forest for G, where k > 1. Fia, any i, 1 < i < k. Let e be an edge of smallest weight in the set {e': e' has exactly one ...
... Lemma 4.3 can be used in an inductive proof to show that, at any stage in the construction, the forest is a subgraph of an MST. Several well-known sequential MST algorithms are special cases of this general strategy. For example, the ...
Inhalt
1 | |
15 | |
Asynchronous Algorithms | 197 |
Asynchronous Shared Memory Algorithms | 235 |
Asynchronous Network Algorithms | 455 |
Partially Synchronous Algorithms | 733 |
Bibliography | 829 |
Index | 857 |
Related Titles from Morgan Kaufmann | 873 |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
Verweise auf dieses Buch
Reasoning About Knowledge Ronald Fagin,Joseph Y. Halpern,Yoram Moses,Moshe Vardi Eingeschränkte Leseprobe - 2004 |