A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks

  • Hyungsoo Jung
  • Heon Y. Yeom
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4128)


This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing when a process runs on asynchronous network systems and its timing constraint is so restricted that the process cannot perform a local-spin in a wait-queue, which forces it to abort whenever it cannot access the critical region immediately. The WDME algorithm proposed in this paper is devised to eliminate the need for processes to send messages to determine whether the critical region has been entered by another process, an unfavorable drawback of a naive transformation of the shared-memory mutual exclusion algorithm to an asynchronous network model. This drawback leads to an unbounded message explosion, and it is very critical in real network systems. Design of the WDME algorithm is simple, and the algorithm is practical enough to be used in current distributed systems. The algorithm has O(1) message complexity which is suboptimal between two consecutive runs of critical section.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, T.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems 1(1), 6–16 (1990)CrossRefGoogle Scholar
  2. 2.
    Anderson, J., Kim, Y.-J.: Fast and scalable mutual exclusion. In: Proceedings of the 13th International Symposium on Distributed Computing, September 1999, pp. 180–194 (1999)Google Scholar
  3. 3.
    Anderson, J., Kim, Y.-J.: Adaptive mutual exclusion with local spinning. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 29–43. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  4. 4.
    Anderson, J., Kim, Y.-J.: A new fast-path mechanism for mutual exclusion. Distributed Computing 14(1), 17–29 (2001)CrossRefGoogle Scholar
  5. 5.
    Fraser, K.: Practical lock-freedom, Ph.D. thesis, King’s College, University of Cambridge (2003)Google Scholar
  6. 6.
    Graunke, G., Thakkar, S.: Synchronization algorithms for shared-memory multiprocessors. IEEE Computer 23, 60–69 (1990)Google Scholar
  7. 7.
    Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1990)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Jayanti, P.: Adaptive and efficient abortable mutual exclusion. In: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 295–304. ACM Press, New York (2003)CrossRefGoogle Scholar
  9. 9.
    Kessels, J.: Arbitration without common modifiable variables. Acta informatica 17, 135–141 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1994)Google Scholar
  11. 11.
    Mellor-Crummey, J., Scott, M.: Algorithms for scalable synchronization on shared-memory multiprocessors. In: Proceedings of the Third ACM Symposium on Principles and Practice of Parallel Programming, April 1991, pp. 106–113. ACM, New York (1991)CrossRefGoogle Scholar
  12. 12.
    Peterson, G.: Myth about the mutual exclusion problem. Information Processing Letter 12(3), 115–116 (1981)zbMATHCrossRefGoogle Scholar
  13. 13.
    Yang, J.-H.: A fast, scalable mutual exclusion algorithm. Distributed Computing 9(1), 51–60 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hyungsoo Jung
    • 1
  • Heon Y. Yeom
    • 1
  1. 1.School of Computer Science and EngineeringSeoul National UniversitySeoulKorea

Personalised recommendations