A new fast-path mechanism for mutual exclusion

Distributed Computing

Volumn 14, Issue 1, 2001, Pages 17-29

  Anderson, J H ^a   Kim, Y J ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Fast mutual exclusion; Local spinning; Read write atomicity; Scalability; Shared memory

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; QUEUEING NETWORKS;

FAST PATH MECHANISM; LOCAL SPINNING; MUTUAL EXCLUSION; READ WRITE ATOMICITY; SHARED MEMORY;

MULTIPROCESSING SYSTEMS;

EID: 0034881332     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008923     Document Type: Article

References (12)

1. Adaptive mutual exclusion with local spinning
2. Fast and scalable mutual exclusion
3. The performance of spin lock alternatives for shared-memory multiprocessors
4. Adaptive solutions to the mutual exclusion problem
5. The communication requirements of mutual exclusion
6. Solution of a problem in concurrent programming control
7. Synchronization algorithms for shared-memory multiprocessors
8. A fast mutual exclusion algorithm
9. Algorithms for scalable synchronization on shared-memory multiprocessors
10. Speeding Lamport's fast mutual exclusion algorithm
11. Wait-free algorithms for fast, long-lived renaming
12. A fast, scalable mutual exclusion algorithm