Distributed algorithms
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...
Main Author: | |
---|---|
Format: | eBook |
Language: | English |
Published: |
San Francisco, Calif.
Morgan Kaufmann Publishers
1996
|
Series: | The Morgan Kaufmann series in data management systems
|
Subjects: | |
Online Access: | |
Collection: | O'Reilly - Collection details see MPG.ReNa |
Table of 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
- Includes bibliographical references (pages 829-856) and index