Anomalies and similarities among consensus numbers of variously-relaxed queues

DOI10.1007/S00607-018-0661-2zbMath1459.68044OpenAlexW2944186964MaRDI QIDQ2218476

Edward Talmage, Jennifer Lundelius Welch

Publication date: 15 January 2021

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-018-0661-2

zbMATH Keywords

distributed computingshared memorydata typesrelaxed data typesconsensus numbers

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds ⋮ Relaxed data types as consistency conditions ⋮ Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks

Cites Work

• Unnamed Item
• Unnamed Item
• On the power of breakable objects
• The computability of relaxed data structures: queues and stacks as examples
• Quantitative relaxation of concurrent data structures
• The Computability of Relaxed Data Structures: Queues and Stacks as Examples
• Impossibility of distributed consensus with one faulty process
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• Generic Proofs of Consensus Numbers for Abstract Data Types.

This page was built for publication: Anomalies and similarities among consensus numbers of variously-relaxed queues