Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Anderson, T.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems 1(1), 6–16 (1990)
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)
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)
Anderson, J., Kim, Y.-J.: A new fast-path mechanism for mutual exclusion. Distributed Computing 14(1), 17–29 (2001)
Fraser, K.: Practical lock-freedom, Ph.D. thesis, King’s College, University of Cambridge (2003)
Graunke, G., Thakkar, S.: Synchronization algorithms for shared-memory multiprocessors. IEEE Computer 23, 60–69 (1990)
Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1990)
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)
Kessels, J.: Arbitration without common modifiable variables. Acta informatica 17, 135–141 (1982)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1994)
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)
Peterson, G.: Myth about the mutual exclusion problem. Information Processing Letter 12(3), 115–116 (1981)
Yang, J.-H.: A fast, scalable mutual exclusion algorithm. Distributed Computing 9(1), 51–60 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, H., Yeom, H.Y. (2006). A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds) Euro-Par 2006 Parallel Processing. Euro-Par 2006. Lecture Notes in Computer Science, vol 4128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11823285_56
Download citation
DOI: https://doi.org/10.1007/11823285_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37783-2
Online ISBN: 978-3-540-37784-9
eBook Packages: Computer ScienceComputer Science (R0)