The cost of concurrent, low-contention Read \& Modify \& Write (Q1770373): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.04.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2097181394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on shared memory for mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention in shared memory algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The notions of consistency and predicate locks in a database system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Read-modify-write networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizable counting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient synchronization of multiprocessors with shared memory / rank
 
Normal rank

Latest revision as of 20:15, 7 June 2024

scientific article
Language Label Description Also known as
English
The cost of concurrent, low-contention Read \& Modify \& Write
scientific article

    Statements

    The cost of concurrent, low-contention Read \& Modify \& Write (English)
    0 references
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    0 references
    Distributed computing
    0 references
    Synchronization
    0 references
    Linearizability
    0 references
    Monotone Linearizability Lemma
    0 references
    Switching networks
    0 references
    Lower bounds
    0 references
    0 references