Distributed Control Algorithms (Selected Topics)
In: F. Ozguner, F. Ercal (Eds.): Parallel Computing on Distributed Memory
Multiprocessors, Springer-Verlag, pp. 167-185, 1993
The paper presents several algorithmic solutions to typical problems from the
theory of distributed computing. The following topics are treated: Distributed
approximation, leader election, routing tables for shortest paths, termination
detection, parallel graph traversal, information dissemination, consistent
snapshot computation. Concepts like atomic actions, message driven
computations, time diagrams, and consistent cuts are introduced and references
to the literature for further reading are given.