Concurrent use of write-once memory

DOI10.1007/978-3-319-48314-6_9MaRDI QIDQ2835021zbMATH OpenOpenAlexFDO

Authors James Aspnes, Keren Censor-Hillel, Eitan Yaakobi

Publication date 1 December 2016

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-48314-6_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14)

Recommendations

• How to reuse a “write-once≓ memory
• Generalized 'write-once' memories
• Making objects writable
• Coding for a Write-Once Memory
• On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?

Cites work

• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• Adaptive and efficient algorithms for lattice agreement and renaming
• Capacity-Achieving Multiwrite WOM Codes
• Codes for Write-Once Memories
• Coding for a Write-Once Memory
• Generalized 'write-once' memories
• High Sum-Rate Three-Write and Nonbinary WOM Codes
• How to reuse a “write-once≓ memory
• Linear binary code for write-once memories (Corresp.)
• New Constructions of WOM Codes Using the Wozencraft Ensemble
• On interprocess communication. I: Basic formalism
• On interprocess communication. II: Algorithms
• On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph
• On the capacity of permanent memory
• On the time and space complexity of ABA prevention and detection
• On the time and space complexity of randomized test-and-set
• Optimal multi-writer multi-reader atomic register
• Polar Write Once Memory Codes
• Polylogarithmic concurrent data structures from monotone circuits
• Position Modulation Code for Rewriting Write-Once Memories
• Short <inline-formula> <tex-math notation="TeX">\(Q\) </tex-math></inline-formula>-Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation
• Strongly linearizable implementations, possibilities and impossibilities
• Sublogarithmic test-and-set against a weak adversary
• Tight bounds for adopt-commit objects
• Time and space optimal implementations of atomic multi-writer register
• WOM-codes construits à partir des codes de Hamming

Cited in

(4)

• Deterministic history-independent strategies for storing information on write-once memories
• Coding for a Write-Once Memory
• On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
• Making objects writable

This page was built for publication: Concurrent use of write-once memory

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