Open Access Open Access  Restricted Access Subscription or Fee Access

A Novel Approach to Allow Process into Critical Section with No Delay-Time

Pradosh Chandra Pattnaik, Md. Shafakhatullah Khan, VSV. Mallikharjuna Rao

Abstract


This paper proposes a new idea which makes the processes not to wait for a long time to enter into a critical section to access a data structure which is already assigned to the other process and that process enters into critical section. Till date so many approaches and algorithms are proposed to reduce the delay time between the successive executions of the critical section, but no one proposed how to assign the data structure to all the process who are requesting for the data structure. In this paper the idea we are proposing is to create an instance of the data structure before assigning to the process and allow each and every process into critical section to avoid the delay time permanently. The proposed algorithm every time creates an instance of the data structure before assigning to the requested process and simultaneously it checks for the instance released by the process already assigned instanced data structure. If when a new process is requesting for the data structure and at the same time already assigned process releases the instance then the coordinator will do both creation and deletion of the instance.

Keywords


Mutual Exclusion, Critical Section, Resource Management, Group Mutual Exclusion

Full Text:

PDF

References


E.W. Dijkstra, “A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic group Set,” IEEE Transactions on Parallel and Distributed Sytems, vol.18, no. 10, p. 1-16, Oct 2007.

L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System,” Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.

G. Ricart and A.K. Agrawala, “An Optimal Algorithm for Mutual Exclusion in Computer Networks,” Comm. ACM, vol. 24, no. 1, pp. 9-17, Jan. 1981.

I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344-349, 1985.

K. Raymond, “A Tree Based Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 61-77, 1989.

Y.-J. Joung, “Quorum-Based Algorithms for Group Mutual Exclusion,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 5, pp. 463-475, May 2003.

Y.-J. Joung, “Asynchronous Group Mutual Exclusion,” Distributed Computing, vol. 13, no. 4, pp. 189-206, 2000.

Guohong Cao, Member, IEEE, and Mukesh Singhal, Fellow, IEEE “A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems”, Ieee Transactions on Parallel and Distributed System, Vol 12, No. 12, Dec 2011.

M. Singhal, “A Heuristically Aided Algorithm for Mutual Exclusion in Distributed Systems”, IEEE Trans. Computers, vol. 38, no. 5, pp. 651-662, May 1989.

Y. Yan, X. Zhang, and H. Yang, “A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies,” J. Parallel and Distributed Computing, vol. 35, pp. 156-172, 1996.

M. Naimi, M. Trehel, and A. Arnold, “A log.n. Distributed Mutual Exclusion Algorithm Based on Path Reversal,” J. Parallel and Distributed Computing, vol. 34, pp. 1-13, 1996.

O. Carvalho and G. Roucairol, “On Mutual Exclusion in Computer Networks, Technical Correspondence,” Comm. ACM, vol. 26, no. 2, pp. 146-147, Feb. 1983.

M. Maekawa, “A √N Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.

M. Singhal, “A Dynamic Information Structure Mutual Exclusion Algorithm for Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 1, pp. 121-125, Jan. 1992.

B. Sanders, “The Information Structure of Distributed Mutual Exclusion Algorithms,” ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284-299, Aug. 1987.

Sandeep Lodha and Ajay Kshemkalyani, “A Fair Distributed Mutual Exclusion Algorithm”, ,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 6, pp. 537-549, June 2000.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.