Composite registers
From MaRDI portal
Publication:2365566
DOI10.1007/BF02242703zbMath0781.68042OpenAlexW2911618284WikidataQ64216178 ScholiaQ64216178MaRDI QIDQ2365566
Publication date: 29 June 1993
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02242703
snapshotinterleaving semanticslinearizabilityconcurrencyatomic registershared variablecomposite register
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)
Related Items (16)
The time complexity of updating snapshot memories ⋮ Efficient algorithms for checking the atomicity of a run of read and write operations ⋮ Geometric and combinatorial views on asynchronous computability ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ Linear-time snapshot implementations in unbalanced systems ⋮ Long-lived counters with polylogarithmic amortized step complexity ⋮ Efficient Bounded Timestamping from Standard Synchronization Primitives ⋮ Anonymous and fault-tolerant shared-memory computing ⋮ Introduction à l'algorithmique des objets partagés ⋮ Atomic snapshots using lattice agreement ⋮ Using local-spin k -exclusion algorithms to improve wait-free object implementations ⋮ Hundreds of impossibility results for distributed computing ⋮ The complexity of updating snapshot objects ⋮ The F-Snapshot Problem ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity ⋮ The power of multiobjects.
Uses Software
Cites Work
- Unnamed Item
- On interprocess communication. I: Basic formalism
- A criterion for atomicity
- Axioms for memory access in asynchronous hardware systems
- Constructing two-writer atomic registers
- Concurrent Reading While Writing
- Concurrent reading and writing
- Atomic snapshots of shared memory
- The elusive atomic register
- Randomized wait-free concurrent objects (extended abstract)
This page was built for publication: Composite registers
