A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
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.
- 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
- 5.Fraser, K.: Practical lock-freedom, Ph.D. thesis, King’s College, University of Cambridge (2003)Google Scholar
- 6.Graunke, G., Thakkar, S.: Synchronization algorithms for shared-memory multiprocessors. IEEE Computer 23, 60–69 (1990)Google Scholar
- 10.Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1994)Google Scholar