 |
Distributed Algorithms View Larger Image | Nancy A. Lynch
Morgan Kaufmann, Hardcover, Published March 1996, 872 pages, ISBN 1558603484 | List Price: $125.00
Our Price: $107.95
You Save: $17.05 (14% Off)
| | | Availability: Out-Of-Stock |
Be the First to Write a Review and tell the world about this title!Books on similar topics, in best-seller order: Books from the same publisher, in best-seller order:
Shows students, programmers, system designers and researchers how to design, implement, and analyze
distributed algorithms. Familiarizes readers with the most important problems, algorithms, and
impossibility results in the area.
Provides the basic mathematical tools for designing new algorithms and proving new impossibility results.
Teaches 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.
Features:
- 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 analyzed according to precisely-defined complexity measures.
- The problems covered include resource allocation, communication, consensus among distributed processors, data consistency, deadlock detection, leader election, global snapshots, and many others.
The material is organized according to the system model -- first, according to the timing model, and then, by the interprocess communication mechanism. The material on system models is
isolated into separate chapters for easy reference.
Contents
- Modeling I: Synchronous Network Model
- Leader Election in a Synchronous Ring
- Algorithms in General Synchronous Networks
- Distributed Consensus with Link Failures
- Distributed Consensus with Process Failures
- More Consensus Problems
- Modeling II: General Asynchronous System Model
- Modeling III: Asynchronous Shared Memory Model
- Mutual Exclusion
- Resource Allocation
- Consensus
- Atomic Objects
- Modeling IV: Asynchronous Network Model
- Basic Asynchronous Network Algorithms
- Synchronizers
- Shared Memory vs. Networks
- Logical Time
- Consistent Global Snapshots and Stable Property Detection
- Network Resource Allocation
- Asynchronous Network Computing with Process Failures
- Data Link Protocols
- Modeling V: Partially Synchronous System Models
- Mutual Exclusion with Partial Synchrony
- Consensus with Partial Synchrony
|
|
