CFP last date
20 June 2024
Reseach Article

A Study of Distributed Deadlock Handling Techniques

Published on July 2015 by Garima Rana, Kanchan, Dilshana Khurshid
Innovations in Computing and Information Technology (Cognition 2015)
Foundation of Computer Science USA
COGNITION2015 - Number 4
July 2015
Authors: Garima Rana, Kanchan, Dilshana Khurshid
05c9ac95-f0ab-4347-936b-f9f1cc4dcf62

Garima Rana, Kanchan, Dilshana Khurshid . A Study of Distributed Deadlock Handling Techniques. Innovations in Computing and Information Technology (Cognition 2015). COGNITION2015, 4 (July 2015), 29-33.

@article{
author = { Garima Rana, Kanchan, Dilshana Khurshid },
title = { A Study of Distributed Deadlock Handling Techniques },
journal = { Innovations in Computing and Information Technology (Cognition 2015) },
issue_date = { July 2015 },
volume = { COGNITION2015 },
number = { 4 },
month = { July },
year = { 2015 },
issn = 0975-8887,
pages = { 29-33 },
numpages = 5,
url = { /proceedings/cognition2015/number4/21911-2176/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Innovations in Computing and Information Technology (Cognition 2015)
%A Garima Rana
%A Kanchan
%A Dilshana Khurshid
%T A Study of Distributed Deadlock Handling Techniques
%J Innovations in Computing and Information Technology (Cognition 2015)
%@ 0975-8887
%V COGNITION2015
%N 4
%P 29-33
%D 2015
%I International Journal of Computer Applications
Abstract

A deadlock is a situation where a process or a set of processes is blocked, waiting on an event that will never occur. In this case of a deadlock, the intervention of a process outside of those involved in the deadlock is required to recover from the deadlock. The formation and existence of deadlocks in a system lowers system efficiency. Therefore, avoiding performance degradation due to deadlocks requires that a system be deadlock free or that deadlocks be quickly detected and eliminated. In this paper, we study deadlock handling strategies in distributed system. Several deadlock techniques based on various control organisations are described. Pros and cons of these techniques are discussed and their performance is compared.

References
  1. Bracha,G. , and S. Toueg, "Distributed Deadlock Detection," Distributed Computing, vol. 2, 1987.
  2. Chandy, K. M. , and L. Lamport, "Distributed Snapshots: Determining Global States of Distributed Systems,"ACM Trans. On Computer Systems, Feb. 1985.
  3. Chandy, K. M. ,J. Mishra, and L. M. Haas. "Distributed Deadlock Detection," ACM Trans. On Computer Systems, May 1983.
  4. Herman,T. , and K. M. Chandy. " A Distributed Procedure to Detect AND/OR Deadlocks. " Tech. Report TR LCS-8301, Dept. of Computer Sciences, University of Texas at Austin, 1983.
  5. Kshemkalyani, A. D. , and M. Singhal, "Efficient Detection and Resolution of Generalized Distributed Deadlocks," IEEE Transactions on Software Engineering, vol. 20, no. 1, Jan. 1994.
  6. Menasce, D. E. , and R. R. Muntz, "Locking and Deadlock Detection in Distribute Databases," IEEE Trans. On Software Engineering, May 1979.
  7. Mitchell, D. P. , and M. J. Merritt, " A Distributed Algorithm for Deadlock Detection and Resolution,"Proc. Of the ACM Conference on Principles of Distributed Computing, Aug. 1984.
  8. Obermarck,R. "Distributed Deadlock Detection Algorithm,"ACM Trans. On Database Systems,June 1982.
  9. Singhal,M. ,"Deadlock Detection in Distributed Systems," IEEE Computer, Nov. . 1989.
  10. Singhal. , Shivaratri. "Advanced Concepts in Operating Systems" McGrawHill, 1994.
Index Terms

Computer Science
Information Sciences

Keywords

Deadlock Handling Techniques Distributed Deadlock Detection Path Pushing Algorithm