Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
From MaRDI portal
Publication:6099028
DOI10.1007/S00446-022-00440-YOpenAlexW4311815247MaRDI QIDQ6099028FDOQ6099028
Authors: Armando Castañeda, Sergio Rajsbaum, Michel Raynal 
Publication date: 19 June 2023
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-022-00440-y
asynchronyconsistency conditionwait-freedomprocess crashlinearizabilitynon-blockingcorrectness conditionset-linearizabilityrelaxed data type
Cites Work
- On interprocess communication. I: Basic formalism
- Title not available (Why is that?)
- Atomic snapshots of shared memory
- Atomic snapshots using lattice agreement
- Concurrent programming: algorithms, principles, and foundations.
- The complexity of obstruction-free implementations
- A completeness theorem for a class of synchronization objects
- Help when needed, but no more: efficient read/write partial snapshot
- Title not available (Why is that?)
- On the inherent sequentiality of concurrent objects
- Quantitative relaxation of concurrent data structures
- The computability of relaxed data structures: queues and stacks as examples
- A scalable lock-free stack algorithm
- Modular verification of concurrency-aware linearizability
- Distributed Computing
- Common2 extended to stacks and unbounded concurrency
- A Single-Enqueuer Wait-Free Queue Implementation
- Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated
- Relaxed data types as consistency conditions
- Unifying Concurrent Objects and Distributed Tasks
- Nontrivial and universal helping for wait-free queues and stacks
- Local linearizability for concurrent container-type data structures
- Limited-use atomic snapshots with polylogarithmic step complexity
This page was built for publication: Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6099028)
