article

Shared-memory mutual exclusion: major research trends since 1986

Authors:

James H. Anderson,

Yong-Jik Kim,

Ted HermanAuthors Info & Claims

Distributed Computing, Volume 16, Issue 2-3

Pages 75 - 110

https://doi.org/10.1007/s00446-003-0088-6

Published: 01 September 2003 Publication History

Abstract

In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [72]. In this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion.

References

[1]

1. U. Abraham, S. Dolev, T. Herman, I. Koll. Self-stabilizing l- exclusion. Theoretical Computer Science, 266: 653-692, 2001

Digital Library

Google Scholar

[2]

2. Y. Afek, H. Attiya, A. Fouren, G. Stupp, D. Touitou. Adaptive long-lived renaming using bounded memory. Unpublished manuscript, 1999

Google Scholar

[3]

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

Digital Library

Google Scholar

[4]

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

Digital Library

Google Scholar

[5]

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

Digital Library

Google Scholar

[6]

6. Y. Afek, G. Stupp, D. Touitou. Long-lived adaptive splitter and applications. Distributed Computing, 15(2): 67-86, 2002

Digital Library

Google Scholar

[7]

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

Digital Library

Google Scholar

[8]

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

Crossref

Google Scholar

[9]

9. R. Alur, G. Taubenfeld. Contention-free complexity of shared memory algorithms. Information and Computation, 126(1): 62-73, April 1996

Digital Library

Google Scholar

[10]

10. R. Alur, G. Taubenfeld. Fast timing-based algorithms. Distributed Computing, 10(1): 1-10, 1996

Digital Library

Google Scholar

[11]

11. J. Anderson. A fine-grained solution to the mutual exclusion problem. Acta Informatica, 30(3): 249-265, May 1993

Digital Library

Google Scholar

[12]

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

Digital Library

Google Scholar

[13]

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

Digital Library

Google Scholar

[14]

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

Digital Library

Google Scholar

[15]

15. J. Anderson, Y.-J. Kim. A new fast-path mechanism for mutual exclusion. Distributed Computing, 14(1): 17-29, January 2001

Digital Library

Google Scholar

[16]

16. J. Anderson, Y.-J. Kim. Local-spin mutual exclusion using fetch-and-φ primitives. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems. IEEE, May 2003 (to appear)

Digital Library

Google Scholar

[17]

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

Digital Library

Google Scholar

[18]

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

Digital Library

Google Scholar

[19]

19. J. Anderson, J.-H. Yang. Time/contention tradeoffs for multiprocessor synchronization. Information and Computation, 124(1): 68-84, January 1996

Digital Library

Google Scholar

[20]

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

Digital Library

Google Scholar

[21]

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

Digital Library

Google Scholar

[22]

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

Digital Library

Google Scholar

[23]

23. H. Attiya, A. Fouren. Adaptive long-lived renaming with read and write operations. Technical Report CS0956, Faculty of Computer Science, Technion, Haifa, 1999

Google Scholar

[24]

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

Digital Library

Google Scholar

[25]

25. J. Burns. Mutual exclusion with linear waiting using binary shared variables. In ACM SIGACT News, pages 42-47, Summer 1978

Digital Library

Google Scholar

[26]

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

Digital Library

Google Scholar

[27]

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

Google Scholar

[28]

28. J. Burns, N. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2): 171-184, December 1993

Digital Library

Google Scholar

[29]

29. M. Choy, A. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1): 1-17, 1994

Digital Library

Google Scholar

[30]

30. P. Courtois, F. Heymans, D. Parnas. Concurrent control with readers and writers. Communications of the ACM, 14(10): 667-668, 1971

Digital Library

Google Scholar

[31]

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

Crossref

Google Scholar

[32]

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

Digital Library

Google Scholar

[33]

33. E. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9): 569, 1965

Digital Library

Google Scholar

[34]

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

Google Scholar

[35]

35. C. Dwork, M. Herlihy, O. Waarts. Contention in shared memory algorithms. Journal of the ACM, 44(6): 779-805, November 1997

Digital Library

Google Scholar

[36]

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

Digital Library

Google Scholar

[37]

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

Digital Library

Google Scholar

[38]

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

Digital Library

Google Scholar

[39]

39. G. Graunke, S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23: 60-69, June 1990

Digital Library

Google Scholar

[40]

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

Digital Library

Google Scholar

[41]

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

Digital Library

Google Scholar

[42]

42. T. Johnson, K. Harathi. A prioritized multiprocessor spin lock. IEEE Transactions on Parallel and Distributed Systems, 8(9): 926-933, September 1997

Digital Library

Google Scholar

[43]

43. Y.-J. Joung. Asynchronous group mutual exclusion. Distributed Computing, 13(4): 189-206, November 2000

Digital Library

Google Scholar

[44]

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

Digital Library

Google Scholar

[45]

45. J. Kessels. Arbitration without common modifiable variables. Acta Informatica, 17: 135-141, 1982

Digital Library

Google Scholar

[46]

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

Digital Library

Google Scholar

[47]

47. Y.-J. Kim, J. Anderson. A space- and time-efficient local-spin spin lock. Information Processing Letters, 84(1): 47-55, September 2002

Digital Library

Google Scholar

[48]

48. Y.-J. Kim, J. Anderson. Using delays to improve RMR time complexity in mutual exclusion algorithms. Unpublished manuscript, 2003

Google Scholar

[49]

49. D. Knuth. Additional comments on a problem in concurrent programming control. Communications of the ACM, 9(5): 321-322, 1966

Digital Library

Google Scholar

[50]

50. L. Kontothanassis, R. Wisniewski, M. Scott. Scheduler-conscious synchronization. ACM Transactions on Computer Systems, 15(1): 3-40, February 1997

Digital Library

Google Scholar

[51]

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

Digital Library

Google Scholar

[52]

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

Digital Library

Google Scholar

[53]

53. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 17(8): 453-455, August 1974

Digital Library

Google Scholar

[54]

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

Digital Library

Google Scholar

[55]

55. L. Lamport. The mutual exclusion problem: Part I - A theory of interprocess communication. Journal of the ACM, 33(2): 313-326, 1986

Digital Library

Google Scholar

[56]

56. L. Lamport. The mutual exclusion problem: Part II - Statement and solutions. Journal of the ACM, 33(2): 327-348, 1986

Digital Library

Google Scholar

[57]

57. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1): 1-11, February 1987

Digital Library

Google Scholar

[58]

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

Digital Library

Google Scholar

[59]

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

Digital Library

Google Scholar

[60]

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

Crossref

Google Scholar

[61]

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

Digital Library

Google Scholar

[62]

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

Crossref

Google Scholar

[63]

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

Digital Library

Google Scholar

[64]

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

Digital Library

Google Scholar

[65]

65. M. Merritt, G. Taubenfeld. Speeding Lamport's fast mutual exclusion algorithm. Information Processing Letters, 45:137-142, 1993

Digital Library

Google Scholar

[66]

66. M. Michael, M. Scott. Fast mutual exclusion, even with contention. Technical Report TR-460, University of Rochester, Rochester, NY, 1993

Digital Library

Google Scholar

[67]

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

Digital Library

Google Scholar

[68]

68. M. Moir, J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25(1): 1-39, October 1995

Digital Library

Google Scholar

[69]

69. G. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3): 115-116, June 1981

Crossref

Google Scholar

[70]

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

Crossref

Google Scholar

[71]

71. M. Rabin. n-process mutual exclusion with bounded waiting by 4 log2n-valued shared variable. Journal of Computer and System Sciences, 25(1): 66-75, August 1982

Crossref

Google Scholar

[72]

72. M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, Cambridge, Massachusetts, 1986

Digital Library

Google Scholar

[73]

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

Digital Library

Google Scholar

[74]

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

Google Scholar

[75]

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

Digital Library

Google Scholar

[76]

76. M. Scott, W. Scherer. Scalable queue-based spin locks with time-out. In Proceedings of the Eighth Annual ACM Symposium on Principles and Practice of Parallel Programming, pages 44-52. ACM, June 2001

Digital Library

Google Scholar

[77]

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

Digital Library

Google Scholar

[78]

78. B. Szymanski. Mutual exclusion revisited. In Proceedings of the Fifth Jerusalem Conference on Information Technology, pages 110-117. IEEE, October 1990

Digital Library

Google Scholar

[79]

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

Digital Library

Google Scholar

[80]

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

Digital Library

Google Scholar

[81]

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

Digital Library

Google Scholar

[82]

82. J.-H. Yang, J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1): 51-60, August 1995

Digital Library

Google Scholar

[83]

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

Digital Library

Google Scholar

Cited By

View all

Attiya HFouren AKo J(2024)Lower Bounds on the Amortized Time Complexity of Shared ObjectsTheory of Computing Systems10.1007/s00224-024-10184-w68:5(1372-1426)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s00224-024-10184-w
Aravind AHesselink W(2019)Group Mutual Exclusion by Fetch-and-incrementACM Transactions on Parallel Computing10.1145/33092025:4(1-29)Online publication date: 22-Feb-2019
https://dl.acm.org/doi/10.1145/3309202
Golab WHendler DNewport CKeidar I(2018)Recoverable Mutual Exclusion Under System-Wide FailuresProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212755(17-26)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212755
Show More Cited By

Index Terms

Shared-memory mutual exclusion: major research trends since 1986

Recommendations

Adaptive mutual exclusion with local spinning

We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity in which all busy waiting is by local spinning. In our algorithm, each process p performs O(k) remote memory references to enter and exit its critical section, ...
A fast, scalable mutual exclusion algorithm

This paper is concerned with synchornization under read/write atomicity in shared memory multi-processors. We present a new algorithm forN-process mutual exclusion that requires only read and write operations and that hasO(logN) time complexity, where "...
Space-efficient FCFS group mutual exclusion

In the group mutual exclusion problem [Y. Joung, Asynchronous group mutual exclusion, Distrib. Comput. 13 (2000) 189], which generalizes mutual exclusion [E. Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM 8 (9) (1965) 569], ...

Comments

Information & Contributors

Information

Published In

Distributed Computing Volume 16, Issue 2-3

Papers in celebration of the 20th anniversary of PODC

September 2003

174 pages

ISSN:0178-2770

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 September 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Attiya HFouren AKo J(2024)Lower Bounds on the Amortized Time Complexity of Shared ObjectsTheory of Computing Systems10.1007/s00224-024-10184-w68:5(1372-1426)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s00224-024-10184-w
Aravind AHesselink W(2019)Group Mutual Exclusion by Fetch-and-incrementACM Transactions on Parallel Computing10.1145/33092025:4(1-29)Online publication date: 22-Feb-2019
https://dl.acm.org/doi/10.1145/3309202
Golab WHendler DNewport CKeidar I(2018)Recoverable Mutual Exclusion Under System-Wide FailuresProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212755(17-26)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212755
Giakkoupis GWoelfel PSchiller ESchwarzmann A(2017)Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC ModelProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087837(221-229)Online publication date: 25-Jul-2017
https://dl.acm.org/doi/10.1145/3087801.3087837
Hendler DGiakkoupis G(2016)On the Complexity of Reader-Writer LocksProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933099(315-324)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933099
Golab WRamaraju AGiakkoupis G(2016)Recoverable Mutual ExclusionProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933087(65-74)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933087
Cicirelli FNigro L(2016)Modelling and Verification of Mutual Exclusion AlgorithmsProceedings of the 20th International Symposium on Distributed Simulation and Real-Time Applications10.1109/DS-RT.2016.16(136-144)Online publication date: 21-Sep-2016
https://dl.acm.org/doi/10.1109/DS-RT.2016.16
Ben-Baruch OHendler DGeorgiou CSpirakis P(2015)The Price of being AdaptiveProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767428(183-192)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767428
Attiya HHendler DWoelfel PGeorgiou CSpirakis P(2015)Trading Fences with RMRs and Separating Memory ModelsProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767427(173-182)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767427
Filippidis IHolzmann GRungta NTkachuk O(2014)An improvement of the piggyback algorithm for parallel model checkingProceedings of the 2014 International SPIN Symposium on Model Checking of Software10.1145/2632362.2632375(48-57)Online publication date: 21-Jul-2014
https://dl.acm.org/doi/10.1145/2632362.2632375
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Adaptive mutual exclusion with local spinning

A fast, scalable mutual exclusion algorithm

Space-efficient FCFS group mutual exclusion

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations