Fast Randomized Test-and-Set and Renaming

DOI10.1007/978-3-642-15763-9_9zbMath1302.68311OpenAlexW1795399553MaRDI QIDQ3588298

Dan Alistarh, Hagit Attiya, Andrei Giurgiu, Seth Gilbert, Rachid Guerraoui

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/149954/files/randomized-renaming.pdf

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (8)

Game-theoretic fairness meets multi-party protocols: the case of leader election ⋮ Tight Bounds for Asynchronous Renaming ⋮ Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms ⋮ Efficient randomized test-and-set implementations ⋮ Unnamed Item ⋮ Randomized consensus with regular registers ⋮ Sub-logarithmic Test-and-Set against a Weak Adversary ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms

This page was built for publication: Fast Randomized Test-and-Set and Renaming