A time complexity lower bound for adaptive mutual exclusion (Q424906): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-011-0152-6 / rank
Normal rank
 
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.1007/s00446-011-0152-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070595838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/contention trade-offs for multiprocessor synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive and efficient mutual exclusion (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant RMR solutions to reader writer synchronization / 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: The <i>k</i> -bakery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing the complexity gap between FCFS mutual exclusion and mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local-Spin Group Mutual Exclusion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ω ( <i>n</i> log <i>n</i> ) lower bound on the cost of mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity separation between the cache-coherent and distributed shared memory models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-RMR implementations of CAS and other synchronization primitives using read and write operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(1)$ RMRs Leader Election Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive randomized mutual exclusion in sub-logarithmic expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized mutual exclusion with sub-logarithmic RMR-complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>f</i> -arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive and efficient abortable mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple local-spin group mutual exclusion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive mutual exclusion with local spinning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding Lamport's fast mutual exclusion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving fast mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-011-0152-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:10, 9 December 2024

scientific article
Language Label Description Also known as
English
A time complexity lower bound for adaptive mutual exclusion
scientific article

    Statements

    A time complexity lower bound for adaptive mutual exclusion (English)
    0 references
    0 references
    0 references
    7 June 2012
    0 references
    adaptive mutual exclusion
    0 references
    algorithmic lower bounds
    0 references
    remote memory references
    0 references
    shared-memory systems
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers