Nonatomic mutual exclusion with local spinning

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 3-12

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

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; ASYMPTOTIC STABILITY; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; EMBEDDED SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; ROM; TREES (MATHEMATICS);

ATOMIC MEMORY; LOCA-SPIN ALGORITHM; LOCAL SPINNING; NONATOMIC ALGORITHM; NONATOMIC MUTUAL EXCLUSION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036964777     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571825.571827     Document Type: Conference Paper

References (30)

1. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 91-103, ACM, May 1999.
2. Y. Afek, P. Boxer, and D. Touitou. Bounds on the shared memory requirements for long-lived and adaptive object. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 81-89, ACM, July 2000.
3. R. Alur and G. Taubenfeld. Contention-free complexity of shared memory algorithms. Information and Computation, 126(1):62-73, April 1996.
4. J. Anderson. A fine-grained solution to the mutual exclusion problem. Acta Informatica, 30(3):249-265, May 1993.
5. J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. In Proceedings of the 14th International Symposium on Distributed Computing, pages 29-43, October 2000.
6. J. Anderson and Y.-J. Kim. An improved lower bound for the time complexity of mutual exclusion. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 90-99, August 2001.
7. J. Anderson and Y.-J. Kim. A new fast-path mechanism for mutual exclusion. Distributed Computing, 14(1):17-29, January 2001.
8. J. Anderson and Y.-J. Kim, Nonatomic mutual exclusion with local spinning (full version of this paper). Available at http://www.cs.unc.edu./~anderson/papers.html
9. J. Anderson and J.-H. Yang. Time/contention tradeoffs for multiprocessor synchronization. Information and Computation, 124(1):68-84, January 1996.
10. T. Anderson, The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6-16, January 1990.
11. H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 91-100, ACM, July 2000.
12. J. Burns and N. Lynch. Mutual exclusion using indivisible reads and writes. In Proceedings of the 18th Annual Allerton Conference on Communication, Control, and Computing, pages 833-842, 1980.
13. M. Choy and A. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1-17, 1994.
14. G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23:60-69, June 1990.
15. S. Haldar and P. Subramaian. Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable. In Proceedings of the Eighth International Workshop on Distributed Algorithms, pages 116-129, Lecture Notes in Computer Science 857, Springer-Verlag, 1994.
16. S. Haldar and K. Vidyasakar. Constructing 1-writer multi-reader multivalued atomic variables from regular variables. Journal of the ACM, 42(1):186-203, 1995.
17. J. Kessels. Arbitration without common modifiable variables. Acta Informatica, 17:135-141, 1982.
18. Y.-J. Kim and J. Anderson. A time complexity bound for adaptive mutual exclusion. In Proceedings of the 15th International Symposium on Distributed Computing, pages 1-15, October 2001.
19. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 17(8):453-455, August 1974.
20. L. Lamport. The mutual exclusion problem: Part II - Statement and solutions. Journal of the ACM, 33(2):327-348, 1986.
21. L. Lamport. On interprocess communication: Part II - Algorithms, Distributed Computing, 1:86-101, 1986.
22. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1-11, February 1987.
23. J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems 9(1):21-65, February 1991.
24. G. Peterson and J. Burns. Concurrent reading while writing II: The multi-writer case. In Proceedings of the 28th Annual ACM Symposium on Foundation of Computer Science, ACM, 1987.
25. R. Schaffer. On the correctness of atomic multi-writer registers. Technical Report MIT/LCS//TM-364, Laboratory for Computer Science, MIT, Cambridge, 1988.
26. A. Singh, J. Anderson, M. Gouda. The elusive atomic register. Journal of the ACM, 41(2):311-339, 1994.
27. E. Styer. Improving fast mutual exclusion. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 159-168, ACM, August 1992.
28. E. Styer and G. Peterson. Tight bounds for shared memory symmetric mutual exclusion. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 177-191, ACM, August 1989.
29. P. Turán. On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok, 48:436-452, 1941.
30. J.-H. Yang and J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1):51-60, August 1995.