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 |
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 |
---|---|
Physical Description: | xxiii, 872 pages illustrations |
ISBN: | 9780080504704 |