Adaptive and Efficient Algorithms for Lattice Agreement and Renaming

DOI10.1137/S0097539700366000zbMath0994.68044OpenAlexW1997124359MaRDI QIDQ2784474

Hagit Attiya, Arie Fouren

Publication date: 23 April 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539700366000

zbMATH Keywords

shared-memory systemsrenamingwait-free computationatomic read/write registersatomic snapshotslattice agreement

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Data structures (68P05) Distributed algorithms (68W15)

Related Items

Tight Bounds for Asynchronous Renaming, Long-lived counters with polylogarithmic amortized step complexity, Adaptive mutual exclusion with local spinning, Renaming in synchronous message passing systems with Byzantine failures, The renaming problem in shared memory systems: an introduction, The RedBlue family of universal constructions, An adaptive collect algorithm with applications, Linear space bootstrap communication schemes, Fully-adaptive algorithms for long-lived renaming, The complexity of updating snapshot objects, A scalable lock-free stack algorithm, Strong order-preserving renaming in the synchronous message passing model, Concurrent Use of Write-Once Memory, Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity