Common2 extended to stacks and unbounded concurrency

DOI10.1007/s00446-007-0023-3zbMath1266.68041OpenAlexW2013271396MaRDI QIDQ1954246

Yehuda Afek, Eli Gafni, Adam Morrison

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-0023-3

zbMATH Keywords

stackswait-freeunbounded concurrencyimmediate snapshotCommon2

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (5)

Extending the wait-free hierarchy to multi-threaded systems ⋮ Bounded disagreement ⋮ Life beyond set agreement ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ Unnamed Item

Cites Work

• A scalable lock-free stack algorithm
• The concurrency hierarchy, and algorithms for unbounded concurrency
• The topological structure of asynchronous computability
• The Instancy of Snapshots and Commuting Objects
• Randomized wait-free concurrent objects (extended abstract)
• A completeness theorem for a class of synchronization objects
• Immediate atomic snapshots and fast renaming
• A Single-Enqueuer Wait-Free Queue Implementation

This page was built for publication: Common2 extended to stacks and unbounded concurrency