Relaxed data types as consistency conditions

DOI10.3390/a11050061zbMath1461.68067OpenAlexW2800840445MaRDI QIDQ2283840

Edward Talmage, Jennifer Lundelius Welch

Publication date: 13 January 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11050061

zbMATH Keywords

consistency conditionsrelaxationsdistributed data structures

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• SprayList

Cites Work

• Unnamed Item
• Unnamed Item
• The computability of relaxed data structures: queues and stacks as examples
• On the composability of consistency conditions
• On interprocess communication. II: Algorithms
• Improved time bounds for linearizable implementations of abstract data types
• Modular verification of concurrency-aware linearizability
• Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
• Anomalies and similarities among consensus numbers of variously-relaxed queues
• Quantitative relaxation of concurrent data structures
• Multiwriter Consistency Conditions for Shared Memory Registers
• A Correctness Condition for High-Performance Multiprocessors
• Relaxed Data Types as Consistency Conditions
• Distributed Computing
• Laws of order
• Distributed Computing

This page was built for publication: Relaxed data types as consistency conditions