Chim-fu Yeung
Abstract
In this paper, a new probe-based distributed deadlock detection algorithm is proposed. It is an enhanced version of the algorithm originally proposed by Chandy's et al. [5,6]. The new algorithm has proven to be error free and suffers very little performance degradation from the additional deadlock detection overhead. The algorithm has been compared with the modified probe-based and timeout methods. It is found that under high data contention, it has the best performance. Results also indicate that the rate of probe initiation is significantly reduced in the new algorithm.
- [1] A. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems," ACM Comp. Sur., Vol. 13, No. 2, pp. 185-221, Jun. 1981. Google Scholar
Digital Library
- [2] A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems, Reading, Massachusetts, Addison-Wesley, 1987. Google ScholarDigital Library
- [3] Chim-fu Yeung, Sheung-lun Hung, Kam-yiu Lam and Chee-keung Law, "A New Distributed Deadlock Detection Algorithm for Distributed Database Systems", IEEE TENCON '94, 1994.Google Scholar
- [4] S. Ceri and G. Pelagatti, Distributed Databases Principles and Systems, New York, McGraw-Hill Book Company, 1984. Google ScholarDigital Library
- [5] M. Chandy and J. Misra, "A distributed algorithm for detecting resource deadlocks in distributed systems", Proceedings of the ACM Symposium on Principles of Distributed Computing (Ottawa, Canada, Aug.), ACM, New York, pp. 157-164, 1982. Google ScholarDigital Library
- [6] M. Chandy, J. Misra, and L. M. Haas, "Distributed Deadlock Detection," ACM Trans. Comput. Syst., Vol. 1, pp. 143-156, May 1983. Google ScholarDigital Library
- [7] N. Choudhary, W. H. Kohler, J. A. Stankovic, and D. Towsley, "A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution," IEEE Trans. Software Eng., Vol. 15, No. 1, pp. 10-17, Jan. 1989. Google ScholarDigital Library
- [8] A. K. Elmagarmid, "A survey of distributed deadlock detection algorithms," ACM SIGMOD Rec. Vol. 15, No. 3, Sep. 1986. Google ScholarDigital Library
- [9] H. Enslow, "What is a "Distributed" Data Processing System?" Computer, Vol. 11, pp. 16-23, Jan. 1978.Google Scholar
- [10] P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The Notions of Consistency and Predicate Locks in a Database System," ACM Comm. Vol. 19, No. 11, pp. 623-633, Nov. 1976. Google ScholarDigital Library
- [11] N. Gray, "Notes on Database Operating System," in Operating Systems: An Advanced Course (Lecture Notes in Computer Science 60), Berlin, Germany, Springer-Verlag, pp. 398-481, 1978. Google ScholarDigital Library
- [12] E. Knapp, "Deadlock Detection in Distributed Database," ACM, Comp. Sur., Vol. 19, No. 4, pp. 302- 328, Dec. 1987. Google ScholarDigital Library
- [13] H. T. Kung and J. T. Robinson, "Optimistic Methods for Concurrency Control," ACM Trans. Database Syst., Vol. 6, pp. 212-226, Jun. 1981. Google ScholarDigital Library
- [14] R. Obermarck, "Distributed Deadlock Detection Algorithm," ACM Trans. Database Syst., Vol. 7, No. 2, pp. 202-223, Jun. 1982. Google ScholarDigital Library
- [15] Y. Parker and J.P. Verjus, Distributed Computing Systems (Synchronization, Control and Communication), Academic Press, 1983. Google ScholarDigital Library
Index Terms
- Performance evaluation of a new distributed deadlock detection algorithm
Recommendations
Distributed deadlock detection algorithm
We propose an algorithm for detecting deadlocks among transactions running concurrently in a distributed processing network (i.e., a distributed database system). The proposed algorithm is a distributed deadlock detection algorithm. A proof of the ...
A Priority Based Distributed Deadlock Detection Algorithm
Deadlock handling is an important component of transaction management in a database system. In this paper, we contribute to the development of techniques for transaction management by presenting an algorithm for detecting deadlocks in a distributed ...
Comments