Asynchronous Exclusive Selection
Bogdan S. Chlebus, Dariusz R. Kowalski

TL;DR
This paper introduces wait-free algorithms for the Renaming problem in asynchronous distributed systems, providing bounds on name range, steps, and register use, and applies these to related problems like Store&Collect and Mining-Names.
Contribution
It presents new wait-free renaming algorithms with optimal bounds, establishes lower bounds, and extends solutions to Store&Collect and Mining-Names problems.
Findings
An adaptive renaming algorithm with $M=8k- ext{lg} k-1$ range.
Lower bounds on steps required for wait-free renaming.
Solutions to Store&Collect and Mining-Names problems with bounded unassigned integers.
Abstract
We consider the task of assigning unique integers to a group of processes in an asynchronous distributed system of a total of processes prone to crashes that communicate through shared read-write registers. In the Renaming problem, an arbitrary group of processes that hold the original names from a range , contend to acquire unique integers in a smaller range as new names using some auxiliary shared registers. We give number of wait-free renaming algorithms, in particular an adaptive one having as a bound on the range of new names that operates in local steps and uses registers. As a lower bound, we show that a wait-free solution to Renaming requires steps in the worst case. We apply renaming algorithms to obtain solutions to Store&Collect problem, which is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Optimization and Search Problems · Interconnection Networks and Systems
