Bounds on the Costs of Multivalued Register Implementations
DOI10.1137/S0097539790190971zbMATH Open0804.68061MaRDI QIDQ4291561FDOQ4291561
Authors: Soma Chaudhuri, Jennifer L. Welch 
Publication date: 10 May 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
- One-write algorithms for multivalued regular and atomic registers
- Almost optimal single reader, single writer atomic register
- Converting Lamport's regular register to atomic register
- Step-optimal implementations of large single-writer registers
- Step optimal implementations of large single-writer registers
registerstime and space complexityconcurrent computationconcurrent distributed systemshared memory registers
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
Cited In (13)
- One-write algorithms for multivalued regular and atomic registers
- How a rainbow coloring function can simulate wait-free handshaking
- Title not available (Why is that?)
- Space Complexity of Fault-Tolerant Register Emulations
- Hundreds of impossibility results for distributed computing
- How Fast Reads Affect Multi-Valued Register Simulations
- Step optimal implementations of large single-writer registers
- Algorithms – ESA 2004
- Information-theoretic lower bounds on the storage cost of shared memory emulation
- Step-optimal implementations of large single-writer registers
- Title not available (Why is that?)
- Weak atomicity: A helpful notion in the construction of atomic shared variables
- Progress-space tradeoffs in single-writer memory implementations
This page was built for publication: Bounds on the Costs of Multivalued Register Implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291561)
