Efficient adaptive collect algorithms

DOI10.1007/s00446-007-0041-1zbMath1266.68204OpenAlexW2007118091MaRDI QIDQ1954244

Yaron De Levie, Yehuda Afek

Publication date: 20 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-007-0041-1

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (1)

Linear space bootstrap communication schemes

Cites Work

• Unnamed Item
• Wait-free algorithms for fast, long-lived renaming
• Efficient adaptive collect using randomization
• The concurrency hierarchy, and algorithms for unbounded concurrency
• Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
• Algorithms adapting to point contention
• Adapting to Point Contention with Long-Lived Safe Agreement
• Atomic snapshots of shared memory
• Distributed Computing
• Efficient Adaptive Collect Using Randomization
• Lower bounds for adaptive collect and related objects

This page was built for publication: Efficient adaptive collect algorithms