Composite registers (Q2365566): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Atomic snapshots of shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A criterion for atomicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing two-writer atomic registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized wait-free concurrent objects (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent reading and writing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interprocess communication. I: Basic formalism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms for memory access in asynchronous hardware systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Reading While Writing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elusive atomic register / rank
 
Normal rank

Revision as of 17:59, 17 May 2024

scientific article
Language Label Description Also known as
English
Composite registers
scientific article

    Statements

    Composite registers (English)
    0 references
    0 references
    29 June 1993
    0 references
    We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is partitioned into a number of components. An operation of a composite register either writes a value to a single component or reads the values of all components. A composite register reduces to an ordinary atomic register when there is only one component. We show that multi-reader, single-writer atomic registers can be used to implement a composite register in which there is only one writer per component. In a related paper, we show how to use the composite register construction of this paper to implement a composite register with multiple writers per component. These two constructions show that it is possible to implement a shared memory that can be read in its entirety in a single snapshot operation, without using mutual exlusion.
    0 references
    concurrency
    0 references
    interleaving semantics
    0 references
    linearizability
    0 references
    shared variable
    0 references
    composite register
    0 references
    atomic register
    0 references
    snapshot
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references