Research Journal of Recent Sciences ________________________________________________ ISSN 2277-2502
Vol. 1 (ISC-2011), 422-425 (2012)
Res.J.Recent Sci.

Mini Review Paper

Approaches for Deadlock Detection and Deadlock Prevention for
Distributed systems
Gupta Dhiraj and Gupta V.K.
Department of Computer Science, NIMS University, Jaipur, Rajasthan, INDIA
Available online at: www.isca.in
(Received 11th October 2011, revised 27th February 2012, accepted 30th March 2012)

Abstract
In today environment Distributed database is mainly used by large organization for their striking features. When we develop
a deadlock detection and prevention approaches for distributed database. A deadlock is a condition in a system where a
process cannot proceed because it needs to obtain a resource held by another process but it itself is holding a resource that
the other process needs. The same conditions for deadlocks in uniprocessors apply to distributed systems. Unfortunately, as
in many other aspects of distributed systems, they are harder to detect, avoid, and prevent. Deadlocks are a fundamental
problem in distributed systems. Deadlock detection is more difficult in systems where there is no such central agent and
processes may communicate directly with one another. Deadlock detection and resolution is one among the major challenges
faced by a Distributed System. In this paper, we discuss deadlock detection techniques and present approaches for detecting
deadlocks in Distributed Systems. We wish that our paper had served as a survey of the important solutions in the fields of
deadlock for distributed system.
Keywords: Distributed real-time databases, mobile real-time databases, concurrency control, data similarity, transaction
scheduling.

References
1. Chandy K.M. and Misra J. A distributed algorithm for
detecting resource deadlocks in distributed systems. In
Proc., A CM SIGA CT-SIGOPS Syrup. Principles of
Distributed Computing, ACM, New York, 157-164
(1982)
2. Tamer M. Ozsu and Patrick Valduriez, Principles of
Distributed Database Systems, Second Edition,
Prentice-Hall, (1999)
3. Bernstein P. and Goodman N., Concurrency Control in
Distributed Database Systems, ACM Computing
Surveys 13/2 (1981)
4. Gligor V.D. and Shattuck S.H., Deadlock detection in
distributed systems, IEEE Trans. Softw., Eng. SE-6, 5
435-440 (1980)
5. Dijkstra N.W, and Scholten C.S., Termination detection
for diffusing computations, Inf. Process. Lett., 11(1), 1-
4 (1980)
6. Goldman B., Deadlock detection in computer networks.
Tech. Rep. MIT-LCS-TR185, Massachusetts Institute
of Technology, Cambridge, Mass., (1977)
7. Gray J.N., Notes on database operating systems. In
Operating Systems: An Advanced Course, Lecture
Notes in Computer Science, Springer-Verlag, New
York, 60, 393-481 (1978)
8. Science Dept., Univ. of Texas at Austin, July (1981). 7.
HOARE, C.A.R. Communicating sequential processes.
Commun. ACM21, 8, 666-677 (1978)
9. Marsland T.A., and Isloor S.S. Detection of deadlocks
in distributed database systems (1980)
10. Chandy K.M. and Misra J., A Distributed Algorithm for
detecting Deadlocks in Distributed Systems, 157-164
(1982)
11. Elmasri Navathe, Database Concepts By Pearson
Education, (2011)
12. Colloly., Data base Concepts By Pearson Education
(2011)
13. Coronel Rob, Introduction to Database Concepts (2011)