Topics in Distributed Algorithms

Front Cover
CUP Archive, Jul 11, 1991 - Computers - 240 pages
This book presents a collection of recent computer algorithms & protocols used in distributed computing & distributed system implementation. Distributed computing involves the sharing of processing power, usually between a mainframe computer & several smaller outpost computers. Each algorithm is explained intuitively, proved correct, & analyzed thoroughly in order to establish what are its essential features. The algorithms cover a wide range of problems in distributed computing & include the following: a class of synchronizers to simulate lock-step operation on an asynchronous processor network; a communication protocol that tolerates & corrects message loss, duplication & resequencing; termination detection algorithms to signify when a distributed computation has finished; algorithms for election, mutual exclusion & distributed garbage collection.
 

What people are saying - Write a review

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

Contents

Synchronization of ABD Networks
35
Assertional Verification
63
Distributed Infimum Approximation
109
Garbage Collection
193
References
227
Bibliography
237
Copyright

Common terms and phrases

Bibliographic information