### On the average communication complexity of asynchronous distributed algorithmsOn the average communication complexity of asynchronous distributed algorithms

Access Restriction
Subscribed

 Author Tsitsiklis, John N. ♦ Stamoulis, George D. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1995 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Asynchronous distributed algorithms Abstract We 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 $\textit{O(nT)},$ where $\textit{n}$ is the number of processors and $\textit{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. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1995-03-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 42 Issue Number 2 Page Count 19 Starting Page 382 Ending Page 400

#### Open content in new tab

Source: ACM Digital Library