On the average communication complexity of asynchronous distributed algorithms

Authors:
John N. Tsitsiklis;George D. Stamoulis
Affiliations:
Massachusetts Institute of Technology, Cambridge, Massachusetts;Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
Journal of the ACM (JACM)
Year:
1995

Citing 3
Cited 2

Complexity of network synchronization

Journal of the ACM (JACM)
Data networks

Data networks
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods

A Randomized Contention-Based Load-Balancing Protocol for a Distributed Multiserver Queuing System

IEEE Transactions on Parallel and Distributed Systems
Analysis of Delays Caused by Local Synchronization

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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 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.