Linearizable read/write objects
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- An upper and lower bound for clock synchronization
- Atomic snapshots of shared memory
- Axioms for memory access in asynchronous hardware systems
- Causal memory: definitions, implementation, and programming
- Clock Synchronization in Distributed Real-Time Systems
- Designing algorithms for distributed systems with partially synchronized clocks
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Implementing hybrid consistency with high-level synchronization operations
- Implementing sequentially consistent shared objects using broadcast and point-to-point communication
- Limitations of fast consistency conditions for distributed shared memories
- Making operations of concurrent data types fast
- Mixed consistency
- On interprocess communication. II: Algorithms
- Optimal precision in the presence of uncertainty
- Practical uses of synchronized clocks in distributed systems
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
- The serializability of concurrent database updates
Cited in
(6)- Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks
- Improved time bounds for linearizable implementations of abstract data types
- Sequentially consistent versus linearizable counting networks
- Hundreds of impossibility results for distributed computing
- An algorithm for replicated objects with efficient reads (extended abstract)
- Eventually linearizable shared objects
This page was built for publication: Linearizable read/write objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292436)
