Adaptive mutual exclusion with local spinning

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

Volumn 1914, Issue , 2000, Pages 29-43

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

^a Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS;

CRITICAL SECTIONS; MUTUAL EXCLUSIONS; READ/WRITE ATOMICITY; REMOTE MEMORY REFERENCES; SPACE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 84958742542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_2     Document Type: Conference Paper

References (14)

1. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proceedings of the 18th ACM Symposium on Principles oj Distributed Computing, pages 91-103, 1999.
2. J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning (full version of this paper). At http://www.cs.unc.edu/~anderson/papers.html.
3. J. Anderson and Y.-J. Kim. Fast and scalable mutual exclusion. In Proceedings of the 13th International Symposium on Distributed Computing, pages 180-194, September 1999. Full version to appear in Distributed Computing.
4. T. Anderson. The performance of spin lock alternatives for shared-memory multi¬processors. IEEE Trans, on Parallel and Distributed Sys., 1(1):6—16, 1990.
5. H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion. To appear in Proceedings of the 19th ACM Symposium on Principles of Distributed Computing.
6. M. Choy and A. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1—17, 1994.
7. E. Dijkstra. Solution of a problem in concurrent programming control. Commu¬nications of the ACM, 8(9):569, 1965.
8. G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory mul¬tiprocessors. IEEE Computer, 23:60-69, 1990.
9. L. Lamport. A fast mutual exclusion algorithm. ACM Trans, on Computer Sys., 5(1): 1—11, 1987.
10. J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans, on Computer Sys., 9(1):21—65, 1991.
11. M. Merritt and G. Taubenfeld. Speeding Lamport’s fast mutual exclusion algo¬rithm. Information Processing Letters, 45:137-142, 1993.
12. M. Moir and J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25(1):1—39, 1995.
13. E. Styer. Improving fast mutual exclusion. In Proceedings of the 11th ACM Sym¬posium on Principles of Distributed Computing, pages 159-168. 1992.
14. J.-H. Yang and J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1):51—60, 1995.