Shared-memory mutual exclusion: Major research trends since 1986

Distributed Computing

Volumn 16, Issue 2-3, 2003, Pages 75-110

  Anderson, James H ^a   Kim, Yong Jik ^a   Herman, Ted ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b University of Iowa   (United States)

Author keywords

exclusion; Adaptive mutual exclusion; Fast mutual exclusion; Group mutual exclusion; Local spinning; Nonatomic algorithms; Shared memory systems; Time complexity; Timing based algorithms

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; DATA STORAGE EQUIPMENT; INDUSTRIAL RESEARCH; INTERCONNECTION NETWORKS;

SHARED MEMORY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0141498457     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-003-0088-6     Document Type: Conference Paper

References (83)

1. U. Abraham, S. Dolev, T. Herman, I. Koll. Self-stabilizing l-exclusion. Theoretical Computer Science, 266: 653-692, 2001
2. Y. Afek, H. Attiya, A. Fouren, G. Stupp, D. Touitou. Adaptive long-lived renaming using bounded memory, Unpublished manuscript, 1999
3. Y. Afek, H. Attiya, A. Fouren, G. Stupp, 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
4. Y. Afek, M. Merritt. Fast, wait-free (2k -1)-renaming. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 105-112. ACM, May 1999
5. Y. Afek, G. Stupp, D. Touitou. Long-lived adaptive collect with applications. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 262-272. IEEE, October 1999
6. Y. Afek, G. Stupp, D. Touitou. Long-lived adaptive splitter and applications. Distributed Computing, 15(2): 67-86, 2002
7. R. Alur, H. Attiya, G. Taubenfeld. Time-adaptive algorithms for synchronization. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 800-809. ACM, May 1994
8. R. Alur, G. Taubenfeld. Results about fast mutual exclusion. In Proceedings of the 13th IEEE Real-time Systems Symposium, pages 12-21. IEEE, 1992
9. R. Alur, G. Taubenfeld. Contention-free complexity of shared memory algorithms. Information and Computation, 126(1): 62-73, April 1996
10. R. Alur, G. Taubenfeld. Fast timing-based algorithms. Distributed Computing, 10(1): 1-10, 1996
11. J. Anderson. A fine-grained solution to the mutual exclusion problem. Acta Informatica, 30(3): 249-265, May 1993
12. J. Anderson, R. Jain, K. Jeffay. Efficient object sharing in quantum-based real-time systems. In Proceedings of the 19th IEEE Real-time Systems Symposium, pages 346-355. IEEE, December 1998
13. J. Anderson, Y.-J. Kim. Adaptive mutual exclusion with local spinning. In Proceedings of the 14th International Symposium on Distributed Computing, pages 29-43, October 2000
14. J. Anderson, 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. ACM, August 2001
15. J. Anderson, Y.-J. Kim. A new fast-path mechanism for mutual exclusion. Distributed Computing, 14(1): 17-29, January 2001
16. J. Anderson, Y.-J. Kim. Local-spin mutual exclusion using fetchand-ø primitives. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems. IEEE, May 2003 (to appear)
17. J. Anderson, Y.-J. Kim. Nonatomic mutual exclusion with local spinning. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, pages 3-12. ACM, July 2002
18. J. Anderson, M. Moir. Using local-spin k-exclusion algorithms to improve wait-free object implementations. Distributed Computing, 11(1): 1-20, September 1997
19. J. Anderson, J.-H. Yang. Time/contention tradeoffs for multiprocessor synchronization. Information and Computation, 124(1): 68-84, January 1996
20. 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
21. H. Attiya, 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
22. H. Attiya, A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 277-286. ACM, July 1998
23. H. Attiya, A. Fouren. Adaptive long-lived renaming with read and write operations. Technical Report CS0956, Faculty of Computer Science, Technion, Haifa, 1999
24. H. Buhrman, J. Garay, J. Hoepman, M. Moir. Long-lived renaming made fast. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 194-203. ACM, August 1995
25. J. Burns. Mutual exclusion with linear waiting using binary shared variables. In ACM SIGACT News, pages 42-47, Summer 1978
26. J. Burns, M. Fischer, P. Jackson, N. Lynch, G. Peterson. Data requirements for implementation of n-process mutual exclusion using a single shared variable. Journal of the ACM, 29(1): 183-205, January 1982
27. J. Burns, 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
28. J. Burns, N. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2): 171-184, December 1993
29. M. Choy, A. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1): 1-17, 1994
30. P. Courtois, F. Heymans, D. Parnas. Concurrent control with readers and writers. Communications of the ACM, 14(10): 667-668, 1971
31. T. Craig. Queuing spin lock algorithms to support timing predictability. In Proceedings of the 14th IEEE Real-time Systems Symposium, pages 148-156. IEEE, December 1993
32. R. Cypher. The communication requirements of mutual exclusion. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, pages 147-156. ACM, June 1995
33. E. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9): 569, 1965
34. E. Dijkstra. Self-stabilizing systems in spite of distributed control, EWD 391. In Selected Writings on Computing: A Personal Perspective, pages 41-46. Springer-Verlag, Berlin, 1982
35. C. Dwork, M. Herlihy, O. Waarts. Contention in shared memory algorithms. Journal of the ACM, 44(6): 779-805, November 1997
36. M. Fischer, N. Lynch, J. Burns, A. Borodin. Resource allocation with immunity to process failure. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pages 234-254. IEEE, October 1979
37. S. Fu, N.-F. Tzeng. A circular list-based mutual exclusion scheme for large shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 8(6): 628-639, June 1997
38. E. Gafni, M. Mitzenmacher. Analysis of timing-based mutual exclusion with random times. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 13-21. ACM, 1999
39. G. Graunke, S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23:60-69, June 1990
40. T.-L. Huang. Fast and fair mutual exclusion for shared memory systems. In Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, pages 224-231. IEEE, June 1999
41. T.-L. Huang, C.-H. Shann. A comment on "A circular list-based mutual exclusion scheme for large shared-memory multiprocessors". IEEE Transactions on Parallel and Distributed Systems, 9(4): 415-416, April 1998
42. T. Johnson, K. Harathi. A prioritized multiprocessor spin lock. IEEE Transactions on Parallel and Distributed Systems, 8(9): 926-933, September 1997
43. Y.-J. Joung. Asynchronous group mutual exclusion. Distributed Computing, 13(4): 189-206, November 2000
44. P. Keane, M. Moir. A simple, local-spin group mutual exclusion algorithm. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 23-32. ACM, May 1999
45. J. Kessels. Arbitration without common modifiable variables. Acta Informatica, 17: 135-141, 1982
46. Y.-J. Kim, J. Anderson. A time complexity bound for adaptive mutual exclusion. In Proceedings of the 15th International Symposium on Distributed Computing, pages 1-15. Springer-Verlag, October 2001
47. Y.-J. Kim, J. Anderson. A space- and time-efficient local-spin spin lock. Information Processing Letters, 84(1): 47-55, September 2002
48. Y.-J. Kim, J. Anderson. Using delays to improve RMR time complexity in mutual exclusion algorithms. Unpublished manuscript, 2003
49. D. Knuth. Additional comments on a problem in concurrent programming control. Communications of the ACM, 9(5): 321-322, 1966
50. L. Kontothanassis, R. Wisniewski, M. Scott. Scheduler-conscious synchronization. ACM Transactions on Computer Systems, 15(1): 3-40, February 1997
51. E. Kushilevitz, Y. Mansour, M. Rabin, D. Zuckerman. Lower bounds for randomized mutual exclusion. SIAM Journal on Computing, 27(6): 1550-1563, December 1998
52. E. Kushilevitz, M. Rabin. Randomized mutual exclusion algorithms revisited. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 275-283. ACM, August 1992
53. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 17(8): 453-455, August 1974
54. L. Lamport. A new approach to proving the correctness of multiprocess programs. ACM Transactions on Programming Languages and Systems, 1(1): 84-97, July 1979
55. L. Lamport. The mutual exclusion problem: Part I - A theory of interprocess communication. Journal of the ACM, 33(2): 313-326, 1986
56. L. Lamport. The mutual exclusion problem: Part II - Statement and solutions. Journal of the ACM, 33(2): 327-348, 1986
57. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1): 1-11, February 1987
58. D. Lehman, A. Pnueli, J. Stavi. Impartiality, justice, and fairness: The ethics of concurrent termination. In Proceedings of the 8th ICALP. Lecture Notes in Computer Science, Vol. 115, Springer Verlag, July 1981
59. E. Lycklama, V. Hadzilacos. A first-come-first-served mutual-exclusion algorithm with small communication variables. ACM Transactions on Programming Languages and Systems, 13(4): 558-576, October 1991
60. N. Lynch, N. Shavit. Timing based mutual exclusion. In Proceedings of the 13th IEEE Real-time Systems Symposium, pages 2-11. IEEE, December 1992
61. P. Magnusson, A. Landin, E. Hagersten. Queue locks on cache coherent multiprocessors. In Proceedings of the 8th International Symposium on Parallel Processing, pages 165-171. IEEE, April 1994
62. E. Markatos. Multiprocessor synchronization primitives with priorities. In Proceedings of the 1991 IFAC Workshop on Real-time Programming, pages 1-7. Pergamon Press, 1991
63. J. Mellor-Crummey, M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1): 21-65, February 1991
64. J. Mellor-Crummey, M. Scott. Scalable reader-writer synchronization for shared-memory multiprocessors. In Proceedings of the Third ACM Symposium on Principles and Practice of Parallel Programming, pages 106-113. ACM, April 1991
65. M. Merritt, G. Taubenfeld. Speeding Lamport's fast mutual exclusion algorithm. Information Processing Letters, 45:137-142, 1993
66. M. Michael, M. Scott. Fast mutual exclusion, even with contention. Technical Report TR-460, University of Rochester, Rochester, NY, 1993
67. M. Moir, J. Anderson. Fast, long-lived renaming. In Proceedings of the 8th International Workshop on Distributed Algorithms, pages 141-155. Springer-Verlag, September 1994
68. M. Moir, J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25(1): 1-39, October 1995
69. G. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3): 115-116, June 1981
70. G. Pfister, V. Norton. "Hot spot" contention and combining in multistage interconnection networks. IEEE Transactions on Computers, C-34(10): 943-948, October 1985
71. 2 n-valued shared variable. Journal of Computer and System Sciences, 25(1): 66-75, August 1982
72. M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, Cambridge, Massachusetts, 1986
73. I. Rhee, C.-Y. Lee. An efficient recovery-based spin lock protocol for preemptive shared-memory, multiprocessors. In Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, pages 77-86. ACM, May 1996
74. R. Rivest, V. Pratt. The mutual exclusion problem for unreliable processes: Preliminary report. In Proceedings of the 17th Annual IEEE Symposium on the Foundation of Computer Science, pages 1-8. IEEE, 1976
75. M. Scott. Non-blocking timeout in scalable queue-based spin locks. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, pages 31-40. ACM, July 2002
76. M. Scott, W. Scherer. Scalable queue-based spin locks with timeout. In Proceedings of the Eighth Annual ACM Symposium on Principles and Practice of Parallel Programming, pages 44-52. ACM, June 2001
77. 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
78. B. Szymanski. Mutual exclusion revisited. In Proceedings of the Fifth Jerusalem Conference on Information Technology, pages 110-117. IEEE, October 1990
79. Y.-K. Tsay. Deriving a scalable algorithm for mutual exclusion. In Proceedings of the 12th International Symposium on Distributed Computing, pages 393-407. Springer Verlag, September 1998
80. R. Wisniewski, L. Kontothanassis, M. Scott. Scalable spin locks for multiprogrammed systems. In Proceedings of the Eighth International Parallel Processing Symposium, pages 26-29. IEEE, April 1994
81. R. Wisniewski, L. Kontothanassis, M. Scott. High performance synchronization algorithms for multiprogrammed multiprocessors. In Proceedings of the Fifth ACM Symposium on Principles and Practices of Parallel Programming, pages 199-206. ACM, July 1995
82. J.-H. Yang, J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1): 51-60, August 1995
83. X. Zhang, Y. Yan, R. Castañeda. Evaluating and designing software mutual exclusion algorithms on shared-memory multiprocessors. IEEE Parallel and Distributed Technology, pages 25-42, Spring Issue, 1996