Strong linearizability using primitives with consensus number 2

DOI10.1145/3662158.3662790MaRDI QIDQ6971918zbMATH OpenFDO

Authors Hagit Attiya, Armando Castañeda, Constantin Enea

Publication date 13 June 2025

Full work available at URL https://doi.org/10.1145/3662158.3662790

zbMATH Keywords

concurrencyconsensus numberslinearizabilitylock-freedomshared memorystrong linearizabilitywait-freedom

Mathematics Subject Classification ID

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

Cites work

• A completeness theorem for a class of synchronization objects
• Atomic snapshots of shared memory
• Common2 extended to stacks and unbounded concurrency
• From bounded to unbounded concurrency objects and back
• scientific article; zbMATH DE number 7774258 (Why is no real title available?)
• scientific article; zbMATH DE number 7832770 (Why is no real title available?)
• Linearizable implementations do not suffice for randomized distributed computation
• MAX registers, counters, and monotone circuits
• Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
• Quantitative relaxation of concurrent data structures
• Set consensus using arbitrary objects (preliminary version)
• Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
• Strongly Linearizable Implementations of Snapshots and Other Types
• Strongly linearizable implementations, possibilities and impossibilities
• The Instancy of Snapshots and Commuting Objects
• Wait-freedom is harder than lock-freedom under strong linearizability
• Weak progressive forward simulation is necessary and sufficient for strong observational refinement

Cited in

(1)

• Preserving hyperproperties of programs using primitives with consensus number 2

This page was built for publication: Strong linearizability using primitives with consensus number 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971918)