AbstractWe study the communication complexity of asynchronous distributed algorithms. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that, under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors under a very general model of distributed computation. Furthermore, for constant-degree processor graphs, the expected number of generated messages is only O(nT), where n is the number of processors and T is the running time. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average. Copyright 1995 by ACM, Inc.
The abstract is also available as a LaTeX file, a DVI file, or a PostScript file.
Categories and Subject Descriptors: C.2.1 [Computer-Communication Networks]: Network Architecture and Design -- network communication; G.1.0 [Numerical Analysis] -- parallel algorithms; G.m [Miscellaneous] -- Queueing theory
General Terms: Algorithms, performance
Additional Key Words and Phrases: asynchronous distributed algorithms
Selected references
- Baruch Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804-823, October 1985.