An Introduction to Distributed Algorithms

Front Cover
MIT Press, 1996 - Computers - 365 pages
1 Review
An Introduction to Distributed Algorithms takes up some of the main concepts and algorithms, ranging from basic to advanced techniques and applications, that underlie the programming of distributed-memory systems such as computer networks, networks of workstations, and multiprocessors. Written from the broad perspective of distributed-memory systems in general it includes topics such as algorithms for maximum flow, program debugging, and simulation that do not appear in more orthodox texts on distributed algorithms.

Moving from fundamentals to advances and applications, ten chapters—with exercises and bibliographic notes—cover a variety of topics. These include models of distributed computation, information propagation, leader election, distributed snapshots, network synchronization, self- stability, termination detection, deadlock detection, graph algorithms, mutual exclusion, program debugging, and simulation.

All of the algorithms are presented in a clear, template- based format for the description of message-passing computations among the nodes of a connected graph. Such a generic setting allows the treatment of problems originating from many different application areas.

The main ideas and algorithms are described in a way that balances intuition and formal rigor—most are preceded by a general intuitive discussion and followed by formal statements as to correctness complexity or other properties.
 

What people are saying - Write a review

LibraryThing Review

User Review  - antiquary - LibraryThing

An American imitation of the Punch Toby competitions (which I dearly loved). They are entries responding to possible options offered by the magazine E.g. comic epitaphs, near-miss titles, etc. Many are at least moderately witty, some are hilarious. Read full review

Contents

Fundamentals
1
Intrinsic Constraints
33
Models of Computation
69
Basic Algorithms
97
Basic Techniques
117
Advances and Applications
149
Graph Algorithms
183
Resource Sharing
219
Program Debugging
253
Simulation
291
Bibliography
323
Author Index
349
Subject Index
357
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

About the author (1996)

Valmir C. Barbosa is Associate Professor of Computer Science at Federal University of Rio de Janeiro.

Bibliographic information