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 86
... chapters are devoted to each type of system model; the first chapter in each group presents a formal model for that type of system, while the rest of the chapters contain the algorithms and impossibility results. Throughout, the ...
... Chapter dependencies. Starred sections. This book contains several sections whose titles are starred in the table of ... chapters without reading the modelling chapters on which they are formally dependent. PREFACE xxi.
... Chapters 3, 4, 6, 7.2, 12, and 14–21, referring to material from the modelling chapters (Chapters 2, 8, and 9) and filling in a few definitions from Chapters 10, 11, and 13 as needed. In a one-semester course emphasizing a thorough ...
Nancy A. Lynch. Chapter. 1. Introduction. 1.1. The. Subject. Matter. The term distributed algorithms covers a large variety of concurrent algorithms used for a wide range of applications. Originally ... Chapter 1. Introduction 1.1 The Subject ...
... Chapter 8 is general enough to describe both asynchronous shared memory systems and asynchronous networks (as well as many other types of asynchronous systems); Chapters 9 and 14 contain the additional structure needed to tailor 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 |