An adaptive collect algorithm with applications

DOI10.1007/s004460100067zbMath1448.68065OpenAlexW2086231977MaRDI QIDQ5138374

Hagit Attiya, Arie Fouren, Eli Gafni

Publication date: 3 December 2020

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

Full work available at URL: https://doi.org/10.1007/s004460100067

zbMATH Keywords

renamingread/write registerswait-free algorithmsimmediate snapshotsatomic snapshotsasynchronous shared-memory systemscontention-sensitive complexity

Mathematics Subject Classification ID

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

Related Items (3)

Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ Linear space bootstrap communication schemes ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention

Cites Work

• Unnamed Item
• Unnamed Item
• Wait-free algorithms for fast, long-lived renaming
• Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
• Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
• Renaming in an asynchronous environment
• The Instancy of Snapshots and Commuting Objects
• Atomic Snapshots in O (n log n) Operations
• The mutual exclusion problem: part I---A theory of interprocess communication
• Adaptive solutions to the mutual exclusion problem
• Atomic snapshots using lattice agreement
• Using local-spin k -exclusion algorithms to improve wait-free object implementations
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
• Wait-free k-set agreement is impossible
• Long-lived renaming made fast
• Immediate atomic snapshots and fast renaming
• Bounded round number

This page was built for publication: An adaptive collect algorithm with applications