TY - JOUR

T1 - Collective asynchronous reading with polylogarithmic worst-case overhead

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

AU - Shvartsman, Alexander A.

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2004

Y1 - 2004

N2 - The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the total number of read and write operations. First abstracted by Saks, Shavit, and Well, Collect is among the standard problems in distributed computing, The model consists of n asynchronous processes, each with a single-writer multi-reader register of a polynomial capacity. The best previously known deterministic solution performs script O sign(n3/2 log n) reads and writes, and it is due to Ajtai, Aspnes, Dwork, and Waarts. This paper presents a new deterministic algorithm that performs script O sign(n log7 n) read/write operations, thus substantially improving the best previous upper bound. Using an approach based on epidemic rumor-spreading, the novelty of the new algorithm is in using a family of expander graphs and ensuring that each of the successive groups of processes collect and propagate sufficiently many rumors to the next group. The algorithm is adapted to the Repeatable Collect problem, which is an on-line version. The competitive latency of the new algorithm is script O sign(log7 n) vs. the much higher competitive latency script O sign(√n log n) given in [3]. A result of independent interest in this paper abstracts a gossiping game that is played on a graph arid that gives its payoff in terms of expansion.

AB - The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the total number of read and write operations. First abstracted by Saks, Shavit, and Well, Collect is among the standard problems in distributed computing, The model consists of n asynchronous processes, each with a single-writer multi-reader register of a polynomial capacity. The best previously known deterministic solution performs script O sign(n3/2 log n) reads and writes, and it is due to Ajtai, Aspnes, Dwork, and Waarts. This paper presents a new deterministic algorithm that performs script O sign(n log7 n) read/write operations, thus substantially improving the best previous upper bound. Using an approach based on epidemic rumor-spreading, the novelty of the new algorithm is in using a family of expander graphs and ensuring that each of the successive groups of processes collect and propagate sufficiently many rumors to the next group. The algorithm is adapted to the Repeatable Collect problem, which is an on-line version. The competitive latency of the new algorithm is script O sign(log7 n) vs. the much higher competitive latency script O sign(√n log n) given in [3]. A result of independent interest in this paper abstracts a gossiping game that is played on a graph arid that gives its payoff in terms of expansion.

KW - Collect

KW - Distributed algorithms

KW - Graph expansion

UR - http://www.scopus.com/inward/record.url?scp=4544267687&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4544267687&partnerID=8YFLogxK

U2 - 10.1145/1007352.1007406

DO - 10.1145/1007352.1007406

M3 - Conference article

AN - SCOPUS:4544267687

SN - 0734-9025

SP - 321

EP - 330

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 36th Annual ACM Symposium on Theory of Computing

Y2 - 13 June 2004 through 15 June 2004

ER -