Efficient randomized test-and-set implementations

DOI10.1007/s00446-019-00349-zzbMath1452.68268arXiv1902.04002OpenAlexW2921448733MaRDI QIDQ2010613

George Giakkoupis, Philipp Woelfel

Publication date: 27 November 2019

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.04002

Mathematics Subject Classification ID

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

Related Items (1)

Short paper: On game-theoretically-fair leader election

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the importance of having an identity or, is consensus really universal?
• Efficient adaptive collect using randomization
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• On the time and space complexity of randomized test-and-set
• Test-and-Set in Optimal Space
• Optimal-time adaptive strong renaming, with applications to counting
• Sub-logarithmic Test-and-Set against a Weak Adversary
• Fast Randomized Test-and-Set and Renaming
• Efficient synchronization of multiprocessors with shared memory
• Randomized two-process wait-free test-and-set
• An $O(1)$ RMRs Leader Election Algorithm
• Lower Bounds for Randomized Consensus under a Weak Adversary
• The Complexity of Renaming
• Faster randomized consensus with an oblivious adversary

This page was built for publication: Efficient randomized test-and-set implementations