Efficient adaptive collect using randomization

DOI10.1007/S00446-005-0143-6MaRDI QIDQ1953647zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Efficient Adaptive Collect Using Randomization
• Efficient adaptive collect algorithms
• Distributed Computing
• An adaptive collect algorithm with applications
• Distributed Computing

Cites work

• scientific article; zbMATH DE number 2006640 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Adaptive and efficient mutual exclusion (extended abstract)
• Algorithms adapting to point contention
• Efficient Adaptive Collect Using Randomization
• Indulgent algorithms (preliminary version)
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
• Randomized wait-free concurrent objects (extended abstract)
• Time and Space Lower Bounds for Nonblocking Implementations
• Wait-free algorithms for fast, long-lived renaming

Cited in

(9)

• Allocate-on-use space complexity of shared-memory algorithms
• Efficient randomized test-and-set implementations
• Efficient Adaptive Collect Using Randomization
• Distributed Computing
• Distributed Computing
• An adaptive collect algorithm with applications
• Spreading Rumors Rapidly Despite an Adversary
• Tight bounds for asynchronous renaming
• Efficient adaptive collect algorithms

This page was built for publication: Efficient adaptive collect using randomization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1953647)