| | |
Summary: Spreading Rumors Rapidly Despite an Adversary
James Aspnes William Hurwoody
Abstract
In the collect problem 32], n processors in a shared-memory
system must each learn the values of n registers. We give
a randomized algorithm that solves the collect problem in
O(nlog3
n) total read and write operations with high prob-
ability, even if timing is under the control of a content-
oblivious adversary (a slight weakening of the usual adap-
tive adversary). This improves on both the trivial upper
bound of O(n2
) steps and the best previously known bound
of O(n3=2
logn) steps, and is close to the lower bound of
(nlogn) steps. Furthermore, we show how this algorithm
can be used to obtain a multi-use cooperative collect proto-
col that is O(log3
n)-competitive in the latency model of Aj-
tai et al. 3] and O(n1=2
|
