Efficient adaptive collect using randomization

DOI10.1007/s00446-005-0143-6zbMath1264.68212OpenAlexW2052556176MaRDI QIDQ1953647

Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, C. Greg Plaxton

Publication date: 7 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-005-0143-6

zbMATH Keywords

randomizationadaptive algorithmstotal contention

Mathematics Subject Classification ID

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

Related Items

Tight Bounds for Asynchronous Renaming, Efficient adaptive collect algorithms, Efficient randomized test-and-set implementations, Allocate-On-Use Space Complexity of Shared-Memory Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Wait-free algorithms for fast, long-lived renaming
• Algorithms adapting to point contention
• Time and Space Lower Bounds for Nonblocking Implementations
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
• Adaptive and efficient mutual exclusion (extended abstract)
• Indulgent algorithms (preliminary version)
• Randomized wait-free concurrent objects (extended abstract)
• Efficient Adaptive Collect Using Randomization