Time and space optimal implementations of atomic multi-writer register

DOI10.1016/J.IC.2004.11.004zbMATH Open1082.68017OpenAlexW2080946165MaRDI QIDQ2486400FDOQ2486400

Authors: Amos Israeli, Amnon Shaham 

Publication date: 5 August 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.11.004

Recommendations

• Optimal multi-writer multi-reader atomic register
• Almost optimal single reader, single writer atomic register
• On interprocess communication and the implementation of multi-writer atomic registers
• Space-optimal multi-writer snapshot objects are slow
• The elusive atomic register

Mathematics Subject Classification ID

Data structures (68P05) Theory of operating systems (68N25)

Cites Work

• On interprocess communication. I: Basic formalism
• On interprocess communication. II: Algorithms
• Atomic snapshots of shared memory
• Bounded time-stamps
• Bounded Concurrent Time-Stamping
• Optimality of wait-free atomic multiwriter variables
• Concurrent Reading While Writing
• On interprocess communication and the implementation of multi-writer atomic registers
• Axioms for memory access in asynchronous hardware systems
• Some combinatorial aspects of time-stamp systems

Cited In (8)

• Introduction à l'algorithmique des objets partagés
• Time-efficient read/write register in crash-prone asynchronous message-passing systems
• Space Complexity of Fault-Tolerant Register Emulations
• Efficient algorithms for checking the atomicity of a run of read and write operations
• Optimal multi-writer multi-reader atomic register
• Multiword atomic read/write registers on multiprocessor systems
• Concurrent use of write-once memory
• Step-optimal implementations of large single-writer registers

This page was built for publication: Time and space optimal implementations of atomic multi-writer register

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486400)