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
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
San Francisco, Calif.
Morgan Kaufmann
1996
|
| Schriftenreihe: | Morgan Kaufmann series in data management systems
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Zusammenfassung: | 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 |
|---|---|
| Beschreibung: | XXIII, 872 S. |
| ISBN: | 1558603484 1-55860-348-4 |