| Description |
1 online resource (xxiii, 872 pages) : illustrations |
| Series |
The Morgan Kaufmann series in data management systems |
|
Morgan Kaufmann series in data management systems.
|
| Contents |
Front Cover; Distributed Algorithms; Copyright Page; Contents; Preface; Chapter 1. Introduction; 1.1 The Subject Matter; 1.2 Our Viewpoint; 1.3 Overview of Chapters 2-25; 1.4 Bibliographic Notes; 1.5 Notation; Part I: Synchronous Network Algorithms; Chapter 2. Modelling I: Synchronous Network Model; Chapter 3. Leader Election in a Synchronous Ring; Chapter 4. Algorithms in General Synchronous Networks; Chapter 5. Distributed Consensus with Link Failures; Chapter 6. Distributed Consensus with Process Failures; Chapter 7. More Consensus Problems; Part II: Asynchronous Algorithms |
| Summary |
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 pr |
| Bibliography |
Includes bibliographical references (pages 829-856) and index |
| Notes |
Print version record |
| Subject |
Electronic data processing -- Distributed processing.
|
|
Computer algorithms.
|
|
Computer networks.
|
|
Algorithms.
|
|
Algorithms
|
|
Computer Communication Networks
|
|
algorithms.
|
|
COMPUTERS -- Client-Server Computing.
|
|
Algorithms
|
|
Computer networks
|
|
Computer algorithms
|
|
Electronic data processing -- Distributed processing
|
|
Gedistribueerde gegevensverwerking.
|
|
Algoritmos e estruturas de dados.
|
| Form |
Electronic book
|
| ISBN |
9780080504704 |
|
0080504701 |
|
