An improved lower bound for the time complexity of mutual exclusion

Distributed Computing

Volumn 15, Issue 4, 2002, Pages 221-253

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

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Atomicity; Local spinning; Lower bounds; Mutual exclusion; Shared memory; Time complexity

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; SYNCHRONIZATION;

MUTUAL EXCLUSION; SHARED MEMORY; TIME COMPLEXITY;

ALGORITHMS;

EID: 0036939044     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0084-2     Document Type: Article

References (20)

1. Afek Y, Boxer P, Touitou D (2000) Bounds on the shared memory requirements for long-lived and adaptive objects. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp 81-89. ACM, July 2000
2. Anderson J, Kim Y-J (2000) Adaptive mutual exclusion with local spinning. In: Proceedings of the 14th International Symposium on Distributed Computing, Lecture Notes in Computer Science, Vol. 1914, pp 29-43. Berlin Heidelberg New York: Springer
3. Anderson J, Kim Y-J (2002) Local-spin mutual exclusion using fetch-and-φ primitives. Manuscript
4. Anderson J, Kim Y-J (2002) Nonatomic mutual exclusion with local spinning. In: Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, pp 3-12. ACM, July 2002
5. Anderson J, Yang J-H (1996) Time/contention tradeoffs for multiprocessor synchronization. Inform Comput 124(1):68-84
6. Anderson T (1990) The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans Parallel Distrib Syst 1(1)6-16
7. Attiya H, Bortnikov V (2000) Adaptive and efficient mutual exclusion. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp 91-100. ACM, July 2000
8. Burns J, Lynch N (1980) Mutual exclusion using indivisible reads and writes. In: Proceedings of the 18th Annual Allerton Conference on Communication, Control, and Computing, pp 833-842
9. Choy M, Singh A (1994) Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1-17
10. Cypher R (1995) The communication requirements of mutual exclusion. In: Proceedings of the Seventh Annual Symposium on Parallel Algorithms and Architectures, pp 147-156
11. Dijkstra E (1965) Solution of a problem in concurrent programming control. Commun ACM, 8(9):569
12. Graunke G, Thakkar S (1990) Synchronization algorithms for shared-memory multiprocessors. IEEE Comput, 23:60-69
13. Kim Y-J, Anderson J (2001) A time complexity bound for adaptive mutual exclusion. In: Proceedings of the 15th International Symposium on Distributed Computing, pp 1-15. Lecture Notes in Computer Science Vol. 2180, Berlin Heidelberg New York: Springer
14. Mellor-Crummey J, Scott M (1991) Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans Comput Syst, 9(1):21-65
15. Merritt M, Taubenfeld G (1991) Speeding Lamport's fast mutual exclusion algorithm. Inform Process Lett, 45:137-142
16. Patterson D, Hennessy J (1997) Computer Organization and Design: The Hardware/Software Interface. Los Altos, CA: Morgan Kaufmann, second edition
17. Styer E (1992) Improving fast mutual exclusion. In: Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pp 159-168. ACM, August 1992
18. Styer E, Peterson G (1989) Tight bounds for shared memory symmetric mutual exclusion. In: Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pp 177-191. ACM, August 1989
19. Turán P (1941) On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok, 48:436-452
20. Yang J-H, Anderson J (1993) Fast, scalable synchronization with minimal hardware support. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pp 171-182. ACM, August 1993.