Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Spreading Rumors Rapidly Despite an Adversary James Aspnes William Hurwoody
 

Summary: Spreading Rumors Rapidly Despite an Adversary
James Aspnes William Hurwoody
January 22, 1997
Abstract
In the collect problem 32], n processors in a shared-memory sys-
tem 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 probability, even if timing is under the con-
trol of a content-oblivious adversary (a slight weakening of the usual
adaptive 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 algorithmcan be used to obtain a multi-usecoopera-
tive collect protocol that is O(log3
n)-competitive in the latency model
of Ajtai et al. 3] and O(n1=2 log3=2
n)-competitive in the throughput
model of Aspnes and Waarts 10]; in both cases the competitive ratios
are within a polylogarithmic factor of optimal.

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences