Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity

DOI10.1007/s00446-022-00440-yOpenAlexW4311815247MaRDI QIDQ6099028

Michel Raynal, Sergio Rajsbaum, Armando Castañeda

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

zbMATH Keywords

consistency conditionlinearizabilityasynchronywait-freedomprocess crashnon-blockingcorrectness conditionset-linearizabilityrelaxed data type

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computability of relaxed data structures: queues and stacks as examples
• Help when needed, but no more: efficient read/write partial snapshot
• A scalable lock-free stack algorithm
• On interprocess communication. I: Basic formalism
• Modular verification of concurrency-aware linearizability
• Common2 extended to stacks and unbounded concurrency
• Relaxed data types as consistency conditions
• On the Inherent Sequentiality of Concurrent Objects
• Quantitative relaxation of concurrent data structures
• Concurrent Programming: Algorithms, Principles, and Foundations
• The complexity of obstruction-free implementations
• Atomic snapshots of shared memory
• Local linearizability for concurrent container-type data structures
• Unifying Concurrent Objects and Distributed Tasks
• Atomic snapshots using lattice agreement
• A completeness theorem for a class of synchronization objects
• Distributed Computing
• Laws of order
• A Single-Enqueuer Wait-Free Queue Implementation
• 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