Anonymous processors with synchronous shared memory: Monte Carlo algorithms

Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider synchronous distributed systems in which processors communicate by shared readwrite variables. Processors are anonymous and do not know their number n. The goal is to assign individual names by all the processors to themselves. We develop algorithms that accomplish this for each of the four cases determined by the following independent properties of the model: concurrently attempting to write distinct values into the same shared memory register either is allowed or not, and the number of shared variables either is a constant or it is unbounded. For each such a case, we give a Monte Carlo algorithm that runs in the optimum expected time and uses the expected number of O(n log n) random bits. All our algorithms produce correct output upon termination with probabilities that are 1-n-Ω(1), which is best possible when terminating almost surely and using O(n log n) random bits.

Original languageEnglish (US)
Title of host publication21st International Conference on Principles of Distributed Systems, OPODIS 2017
EditorsJames Aspnes, Joao Leitao, Alysson Bessani, Pascal Felber
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770613
DOIs
StatePublished - Mar 1 2018
Externally publishedYes
Event21st International Conference on Principles of Distributed Systems, OPODIS 2017 - Lisboa, Portugal
Duration: Dec 18 2017Dec 20 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume95
ISSN (Print)1868-8969

Conference

Conference21st International Conference on Principles of Distributed Systems, OPODIS 2017
CountryPortugal
CityLisboa
Period12/18/1712/20/17

Fingerprint

Data storage equipment

Keywords

  • Anonymous processors
  • Monte Carlo algorithms
  • Naming
  • Read-write registers
  • Shared memory
  • Synchrony

ASJC Scopus subject areas

  • Software

Cite this

Chlebus, B. S., De Marco, G., & Talo, M. (2018). Anonymous processors with synchronous shared memory: Monte Carlo algorithms. In J. Aspnes, J. Leitao, A. Bessani, & P. Felber (Eds.), 21st International Conference on Principles of Distributed Systems, OPODIS 2017 [15] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 95). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.OPODIS.2017.15

Anonymous processors with synchronous shared memory : Monte Carlo algorithms. / Chlebus, Bogdan S.; De Marco, Gianluca; Talo, Muhammed.

21st International Conference on Principles of Distributed Systems, OPODIS 2017. ed. / James Aspnes; Joao Leitao; Alysson Bessani; Pascal Felber. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. 15 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 95).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS, De Marco, G & Talo, M 2018, Anonymous processors with synchronous shared memory: Monte Carlo algorithms. in J Aspnes, J Leitao, A Bessani & P Felber (eds), 21st International Conference on Principles of Distributed Systems, OPODIS 2017., 15, Leibniz International Proceedings in Informatics, LIPIcs, vol. 95, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisboa, Portugal, 12/18/17. https://doi.org/10.4230/LIPIcs.OPODIS.2017.15
Chlebus BS, De Marco G, Talo M. Anonymous processors with synchronous shared memory: Monte Carlo algorithms. In Aspnes J, Leitao J, Bessani A, Felber P, editors, 21st International Conference on Principles of Distributed Systems, OPODIS 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018. 15. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.OPODIS.2017.15
Chlebus, Bogdan S. ; De Marco, Gianluca ; Talo, Muhammed. / Anonymous processors with synchronous shared memory : Monte Carlo algorithms. 21st International Conference on Principles of Distributed Systems, OPODIS 2017. editor / James Aspnes ; Joao Leitao ; Alysson Bessani ; Pascal Felber. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{247b93053ae640f3b18e2175b5550d2d,
title = "Anonymous processors with synchronous shared memory: Monte Carlo algorithms",
abstract = "We consider synchronous distributed systems in which processors communicate by shared readwrite variables. Processors are anonymous and do not know their number n. The goal is to assign individual names by all the processors to themselves. We develop algorithms that accomplish this for each of the four cases determined by the following independent properties of the model: concurrently attempting to write distinct values into the same shared memory register either is allowed or not, and the number of shared variables either is a constant or it is unbounded. For each such a case, we give a Monte Carlo algorithm that runs in the optimum expected time and uses the expected number of O(n log n) random bits. All our algorithms produce correct output upon termination with probabilities that are 1-n-Ω(1), which is best possible when terminating almost surely and using O(n log n) random bits.",
keywords = "Anonymous processors, Monte Carlo algorithms, Naming, Read-write registers, Shared memory, Synchrony",
author = "Chlebus, {Bogdan S.} and {De Marco}, Gianluca and Muhammed Talo",
year = "2018",
month = "3",
day = "1",
doi = "10.4230/LIPIcs.OPODIS.2017.15",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "James Aspnes and Joao Leitao and Alysson Bessani and Pascal Felber",
booktitle = "21st International Conference on Principles of Distributed Systems, OPODIS 2017",
address = "Germany",

}

TY - GEN

T1 - Anonymous processors with synchronous shared memory

T2 - Monte Carlo algorithms

AU - Chlebus, Bogdan S.

AU - De Marco, Gianluca

AU - Talo, Muhammed

PY - 2018/3/1

Y1 - 2018/3/1

N2 - We consider synchronous distributed systems in which processors communicate by shared readwrite variables. Processors are anonymous and do not know their number n. The goal is to assign individual names by all the processors to themselves. We develop algorithms that accomplish this for each of the four cases determined by the following independent properties of the model: concurrently attempting to write distinct values into the same shared memory register either is allowed or not, and the number of shared variables either is a constant or it is unbounded. For each such a case, we give a Monte Carlo algorithm that runs in the optimum expected time and uses the expected number of O(n log n) random bits. All our algorithms produce correct output upon termination with probabilities that are 1-n-Ω(1), which is best possible when terminating almost surely and using O(n log n) random bits.

AB - We consider synchronous distributed systems in which processors communicate by shared readwrite variables. Processors are anonymous and do not know their number n. The goal is to assign individual names by all the processors to themselves. We develop algorithms that accomplish this for each of the four cases determined by the following independent properties of the model: concurrently attempting to write distinct values into the same shared memory register either is allowed or not, and the number of shared variables either is a constant or it is unbounded. For each such a case, we give a Monte Carlo algorithm that runs in the optimum expected time and uses the expected number of O(n log n) random bits. All our algorithms produce correct output upon termination with probabilities that are 1-n-Ω(1), which is best possible when terminating almost surely and using O(n log n) random bits.

KW - Anonymous processors

KW - Monte Carlo algorithms

KW - Naming

KW - Read-write registers

KW - Shared memory

KW - Synchrony

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

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

U2 - 10.4230/LIPIcs.OPODIS.2017.15

DO - 10.4230/LIPIcs.OPODIS.2017.15

M3 - Conference contribution

AN - SCOPUS:85045680272

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 21st International Conference on Principles of Distributed Systems, OPODIS 2017

A2 - Aspnes, James

A2 - Leitao, Joao

A2 - Bessani, Alysson

A2 - Felber, Pascal

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -