Abstract
A high efficiency Distributed Mutual Exclusion (DMX) algorithm based on RA algorithm, is presented. It puts different mutual exclusion operations for reading and writing requests. The algorithm, belonging to nontoken-based type, saves the message complexity while has T synchronization delay. A read/write globe clock stamp which based on the Lamport clock stamp is put forward for the read/write operations. Using the read/write globe clock stamp, reading and writing requests can access Critical Sections (CS) with fairness. Furthermore, a dynamic detection mechanism is adopted in the algorithm to realize self-stability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chang, Y.-I.: A Simulation Study on Distributed Mutual Exclusion. J. Parallel and Distributed Computing 33, 107–121 (1996)
Singhal, M.: A taxonomy of Distributed Mutual Exclusion. J.Parallel and Distributed Computing 18(1), 94–101 (1993)
Burns, R.C.: Semi-Preemptible Locks for a Distributed File System. In: Performance, Computing, and Communications Conference, IPCCC 2000, Conference. Proceeding of the IEEE International, pp. 397–404 (2000)
Mizuno, M., Nesterenko, M., Kakugawa, H.: Lock-based self-stabilizing distributed mutual exclusion algorithms Distributed Computing Systems. In: Proceedings of the 16th International Conference on, pp. 708–716 (1996)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)
Carvalho, O., Roucairol, G.: On Mutual Exclusion in Computer Networks. Technical Correspondence, Comm. ACM 26(2), 146–147 (1983)
Lamport, L.: Time, ”Clocks and the Ordering of Events in Distributed Systems. Comm. ACM 21(7), 558–565 (1978)
Ricart, G., Agrawala, A.K.: An Optimal Algorithm for Mutual Exclusion in Computer Networks. Comm. ACM 24(1), 9–17 (1981)
Lodha, S., Kshemkalyani, A.: A fair distributed mutual exclusion algorithm” Parallel and Distributed Systems. IEEE Transactions on 11(6), 537–549 (2000)
Gouda, M.G., Multari, N.J.: Stabilizing communication protocols. Computers, IEEE Transactions on 40(4), 448–458 (1991)
Sanders, B.: The information structure of distributed mutual exclustion algorithms. ACM Transactions on Computer Systems 5(3), 284–299 (1987)
Raynal, M.: A simple taxonomy for distributed mutual exclustion algorithm. ACM Operating Systems Review 25(2), 47–50 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, D., Liu, X., Qiu, Z., Yan, G. (2003). A High Efficiency Distributed Mutual Exclusion Algorithm. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39425-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20054-3
Online ISBN: 978-3-540-39425-9
eBook Packages: Springer Book Archive