http://worldcat.org/entity/work/id/19527356

On the average communication complexity of asynchronous distributed algorithms

Abstract: "We study the communication complexity of asychronous distributed algorithms, such as the distributed Bellman-Ford algorithm for the shortest path problem. 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. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average."

Open All Close All