@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",
note = "Publisher Copyright: {\textcopyright} 2017 Bogdan S. Chlebus, Gianluca De Marco, and Muhammed Talo.; 21st International Conference on Principles of Distributed Systems, OPODIS 2017 ; Conference date: 18-12-2017 Through 20-12-2017",
year = "2018",
month = mar,
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",
}