Linearizable read/write objects
From MaRDI portal
Publication:1292436
DOI10.1016/S0304-3975(98)90244-4zbMATH Open0916.68014MaRDI QIDQ1292436FDOQ1292436
Authors: Marios Mavronicolas, Dan Roth 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Causal memory: definitions, implementation, and programming
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- On interprocess communication. II: Algorithms
- Title not available (Why is that?)
- The serializability of concurrent database updates
- Atomic snapshots of shared memory
- Optimal precision in the presence of uncertainty
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
- Clock Synchronization in Distributed Real-Time Systems
- An upper and lower bound for clock synchronization
- Limitations of fast consistency conditions for distributed shared memories
- Axioms for memory access in asynchronous hardware systems
- Practical uses of synchronized clocks in distributed systems
- Implementing sequentially consistent shared objects using broadcast and point-to-point communication
- 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
Cited In (6)
- Sequentially consistent versus linearizable counting networks
- Hundreds of impossibility results for distributed computing
- Improved time bounds for linearizable implementations of abstract data types
- An algorithm for replicated objects with efficient reads (extended abstract)
- Eventually linearizable shared objects
- Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks
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)
