Linearizable read/write objects

DOI10.1016/S0304-3975(98)90244-4zbMath0916.68014MaRDI QIDQ1292436

Dan Roth, Marios Mavronicolas

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

shared-memory multiprocessors

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items

Improved time bounds for linearizable implementations of abstract data types ⋮ Hundreds of impossibility results for distributed computing ⋮ Sequentially consistent versus linearizable counting networks ⋮ Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks

Cites Work

• Unnamed Item
• On interprocess communication. II: Algorithms
• Optimal precision in the presence of uncertainty
• Practical uses of synchronized clocks in distributed systems
• Limitations of fast consistency conditions for distributed shared memories
• An upper and lower bound for clock synchronization
• Axioms for memory access in asynchronous hardware systems
• Implementing sequentially consistent shared objects using broadcast and point-to-point communication
• The serializability of concurrent database updates
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Atomic snapshots of shared memory
• Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
• Clock Synchronization in Distributed Real-Time Systems
• Causal memory: definitions, implementation, and programming
• Implementing hybrid consistency with high-level synchronization operations
• Designing algorithms for distributed systems with partially synchronized clocks
• Making operations of concurrent data types fast
• Mixed consistency

This page was built for publication: Linearizable read/write objects