Design and Analysis of Distributed Algorithms

Front Cover
John Wiley & Sons, Nov 3, 2006 - Computers - 730 pages
0 Reviews
This text is based on a simple and fully reactive computational model that allows for intuitive comprehension and logical designs. The principles and techniques presented can be applied to any distributed computing environment (e.g., distributed systems, communication networks, data networks, grid networks, internet, etc.). The text provides a wealth of unique material for learning how to design algorithms and protocols perform tasks efficiently in a distributed computing environment.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

1 Distributed Computing Environments
1
2 Basic Problems And Protocols
29
3 Election
99
4 Message Routing and Shortest Paths
225
5 Distributed Set Operations
277
6 Synchronous Computations
333
7 Computing in Presence of Faults
408
8 Detecting Stable Properties
500
9 Continuous Computations
541
Index
577
PROTOCOL INDEX
584
AUTHOR INDEX
586
Copyright

Common terms and phrases

Popular passages

Page 3 - Given a directed graph G = (V, E) where, V is the set of vertices and E is the set of edges...

About the author (2006)

NICOLA SANTORO, PhD, is Professor of Computer Science at Carleton University. Dr. Santoro has been involved in distributed computing from the beginning of the field. He has contributed extensively on the algorithmic aspects, authoring many seminal papers. He is a founder of the main theoretical conferences in the field (PODC, DISC, SIROCCO). His current research is on distributed algorithms for mobile agents, autonomous mobile robots, and mobile sensor networks.

Bibliographic information