Cooperative asynchronous update of shared memory

Research output: Contribution to journalConference article

Abstract

The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the total number of read and write operations. First abstracted by Kanellakis and Shvartsman [12], Write-All is among the standard problems in distributed computing. The model consists of n asynchronous processes and n registers, where every process can read and write to any register. Processes may fail by crashing. The most efficient previously known deterministic algorithm performs O(n1+ε) reads and writes, for an arbitrary fixed constant ε > 0, and is due to Anderson and Woll [4], This paper presents a new deterministic algorithm that performs O(n polylog n) read/write operations, thus improving the best previously known upper bound from polynomial to polylogarithmic in the average number of read/write operations per process. Using an approach to store and retrieve information about progress made in auxiliary registers, the novelty of the new algorithm is in using a family of multi-partite graphs with expansion properties to structure a set of registers as a graph and then have each asynchronous process explore a part of the graph according to its pattern of traversals. An explicit instantiation of our Write-All algorithm, based on best-known polynomial-time constructions of lossless expanders and a-expanding graphs, performs n · 2O (log3 logn) reads and writes. In this explicit solution to Write-All, the processes perform asymptotically less read/write operations than the most efficient non-explicit solution known before.

Original languageEnglish (US)
Pages (from-to)733-739
Number of pages7
JournalProceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - Dec 1 2005
Externally publishedYes
Event13th Color Imaging Conference: Color Science, Systems, Technologies, and Applications - Scottsdale, AZ, United States
Duration: Nov 7 2005Nov 11 2005

Fingerprint

Data storage equipment
Polynomials
Distributed computer systems

Keywords

  • Asynchrony
  • Disperser
  • Distributed algorithm
  • Expander
  • Problem Write-All
  • Read and write register
  • Work efficiency

ASJC Scopus subject areas

  • Software

Cite this

@article{8b98defcc06f48458e6fec50a38bb476,
title = "Cooperative asynchronous update of shared memory",
abstract = "The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the total number of read and write operations. First abstracted by Kanellakis and Shvartsman [12], Write-All is among the standard problems in distributed computing. The model consists of n asynchronous processes and n registers, where every process can read and write to any register. Processes may fail by crashing. The most efficient previously known deterministic algorithm performs O(n1+ε) reads and writes, for an arbitrary fixed constant ε > 0, and is due to Anderson and Woll [4], This paper presents a new deterministic algorithm that performs O(n polylog n) read/write operations, thus improving the best previously known upper bound from polynomial to polylogarithmic in the average number of read/write operations per process. Using an approach to store and retrieve information about progress made in auxiliary registers, the novelty of the new algorithm is in using a family of multi-partite graphs with expansion properties to structure a set of registers as a graph and then have each asynchronous process explore a part of the graph according to its pattern of traversals. An explicit instantiation of our Write-All algorithm, based on best-known polynomial-time constructions of lossless expanders and a-expanding graphs, performs n · 2O (log3 logn) reads and writes. In this explicit solution to Write-All, the processes perform asymptotically less read/write operations than the most efficient non-explicit solution known before.",
keywords = "Asynchrony, Disperser, Distributed algorithm, Expander, Problem Write-All, Read and write register, Work efficiency",
author = "Chlebus, {Bogdan S.} and Kowalski, {Dariusz R.}",
year = "2005",
month = "12",
day = "1",
doi = "10.1145/1060590.1060698",
language = "English (US)",
pages = "733--739",
journal = "Proceedings of the Annual ACM Symposium on Theory of Computing",
issn = "0737-8017",
publisher = "Association for Computing Machinery (ACM)",

}

TY - JOUR

T1 - Cooperative asynchronous update of shared memory

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the total number of read and write operations. First abstracted by Kanellakis and Shvartsman [12], Write-All is among the standard problems in distributed computing. The model consists of n asynchronous processes and n registers, where every process can read and write to any register. Processes may fail by crashing. The most efficient previously known deterministic algorithm performs O(n1+ε) reads and writes, for an arbitrary fixed constant ε > 0, and is due to Anderson and Woll [4], This paper presents a new deterministic algorithm that performs O(n polylog n) read/write operations, thus improving the best previously known upper bound from polynomial to polylogarithmic in the average number of read/write operations per process. Using an approach to store and retrieve information about progress made in auxiliary registers, the novelty of the new algorithm is in using a family of multi-partite graphs with expansion properties to structure a set of registers as a graph and then have each asynchronous process explore a part of the graph according to its pattern of traversals. An explicit instantiation of our Write-All algorithm, based on best-known polynomial-time constructions of lossless expanders and a-expanding graphs, performs n · 2O (log3 logn) reads and writes. In this explicit solution to Write-All, the processes perform asymptotically less read/write operations than the most efficient non-explicit solution known before.

AB - The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the total number of read and write operations. First abstracted by Kanellakis and Shvartsman [12], Write-All is among the standard problems in distributed computing. The model consists of n asynchronous processes and n registers, where every process can read and write to any register. Processes may fail by crashing. The most efficient previously known deterministic algorithm performs O(n1+ε) reads and writes, for an arbitrary fixed constant ε > 0, and is due to Anderson and Woll [4], This paper presents a new deterministic algorithm that performs O(n polylog n) read/write operations, thus improving the best previously known upper bound from polynomial to polylogarithmic in the average number of read/write operations per process. Using an approach to store and retrieve information about progress made in auxiliary registers, the novelty of the new algorithm is in using a family of multi-partite graphs with expansion properties to structure a set of registers as a graph and then have each asynchronous process explore a part of the graph according to its pattern of traversals. An explicit instantiation of our Write-All algorithm, based on best-known polynomial-time constructions of lossless expanders and a-expanding graphs, performs n · 2O (log3 logn) reads and writes. In this explicit solution to Write-All, the processes perform asymptotically less read/write operations than the most efficient non-explicit solution known before.

KW - Asynchrony

KW - Disperser

KW - Distributed algorithm

KW - Expander

KW - Problem Write-All

KW - Read and write register

KW - Work efficiency

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

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

U2 - 10.1145/1060590.1060698

DO - 10.1145/1060590.1060698

M3 - Conference article

AN - SCOPUS:34848882218

SP - 733

EP - 739

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

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

SN - 0737-8017

ER -