Single Queue Based Algorithm for Mutual Exclusion iIn Distributed Systems
Keywords:
Distributed System, Critical Section, Single Queue Algorithm, Non-Token, Mutual ExclusionAbstract
Distributed System is a class of computing systems in the field of computing where the hardware or software components of the system are located at networked locations. Computers that are the part of this system can communicate and coordinate their action only by exchange of messages in the system. Mutual exclusion is a mechanism in which multi-process can make access to the single sharable resource without affecting the integrity of the resource. The number of messages among the sites of the distributed system is one of the very prime concerned issue in analysing the performance of any algorithm. Also the amount of data structures needed in the one of prime consideration in the performance analysis of algorithm. The algorithm proposed in this paper reduces the number of messages to a large extend and also there is need of a single queue as a data structure.
References
- G. Ricart and A. K. Agrawala, &ldquo, "An Optimal Algorithm for Mu tual Exclusion in Computer Netw orks &rdquo, Co mm".ACM, vol. 24, no. 1, pp. 9-17, Jan. 1981.
- J.-H . Yang and J. An derson, &ldquo,Time Bounds for Mutual Exclusion and Related Problem s &rdquo, Proc. 26th Ann. ACM Symp. "Theory of Co mputing, pp. 224-2 33," May 1994.
- D.A grawal, A.El. Ab badi, "An efficie nt and fault toler ant solution for distributed mutual? exclusion"ACM Transaction on Co mputer Systems 9 (1) (1991) 1-20.
- Ashish Chauhan, Kanupriya, "Centralized Approach to mutual Exclusion in Distributed Systems" International Journal of Advanced Research in Computer and Communication Engineering Vol. 4, Issue 12, December 2015
Downloads
Published
Issue
Section
License
Copyright (c) IJSRST

This work is licensed under a Creative Commons Attribution 4.0 International License.