Fast and scalable mutual exclusion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1693, Issue , 1999, Pages 180-195

  Anderson, James H ^a   Kim, Yong Jik ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

ANDERSONS; FAST PATH; MUTUAL EXCLUSIONS; PROCESS ALGORITHMS; READ/WRITE ATOMICITY; REMOTE MEMORY REFERENCES; TIME COMPLEXITY; TREE ALGORITHMS;

TREES (MATHEMATICS);

EID: 84947932078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48169-9_13     Document Type: Conference Paper

References (8)

1. T. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. on Parallel and Distributed Sys., 1(1):6–16, 1990. 180, 180
2. R. Cypher. The communication requirements of mutual exclusion. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, pages 147–156, 1995. 194
3. E. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965. 180
4. G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23:60–69, 1990. 180, 180
5. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. on Computer Sys., 5(1):1–11, 1987. 182
6. J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. on Computer Sys., 9(1):21–65, 1991. 180, 180
7. M. Moir and J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25(1):1–39, 1995. 194
8. J.-H. Yang and J. Anderson. Fast, scalable synchronization with minimal hardware support. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 171–182. 1993. 180, 194