A Priority Based Distributed Deadlock Detection Algorithm

IEEE Transactions on Software Engineering

Volumn SE-11, Issue 1, 1985, Pages 67-80

  Sinha, Mukul K ^a   Natarajan, N ^a  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Deadlock; deadlock detection; distributed database; nested transaction; priority; timestamp; transaction

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

CONCURRENCY; DEADLOCK DETECTION ALGORITHM;

DATABASE SYSTEMS;

EID: 0021786063     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1985.231844     Document Type: Article

References (16)

1. [1] R. Bayer, K. Elhardt, J. Heigert, and A. Reiser, “Dynamic timestamp stamp allocation for transactions in database systems,” in Distributed Databases, H. J. Schneider, Ed. Amsterdam, The Netherlands: North-Holland, 1982, pp. 9–20.
2. [2] P. A. Bernstein and N. Goodman, “Concurrency control in distributed database systems,” ACM Comput. Surveys, vol. 13, pp. 185–221, June, 1981. Comput.
3. [3] K. M. Chandy and J. Misra, “A distributed algorithm for detecting resource deadlocks in distributed systems,” in Proc. ACM SIGACT-SIGOPS Symp. Principles of Disbributed Computing, Ottawa, Ont., Canada, Aug. 1982.
4. [4] K. M. Chandy, J. Misra, and L. M. Haas, “Distributed-deadlock detection,” ACM Trans. Comput. Syst., vol. 1, pp. 144–156, May 1983.
5. [5] E. G. Coffman, Jr., M. J. Elphick, and A. Shoshani, “System deadlocks,” ACM Comput. Surveys, vol. 3, pp. 66–78, June 1971.
6. [6] C. T. Davies, “Recovery semantics for a DB/DC system,” in Proc. ACM Nat. Conf.; vol. 28, 1973, pp. 136–141.
7. [7] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, “The notion of consistency and predicate locks in a database system,” Commun. ACM, vol. 19, 624–633, Nov. 1976.
8. [8] V. D. Gligor and S. H. Shattuck, “On deadlock detection in distributed systems,” IEEE Trans. Software Eng., vol. SE-6, pp. 435–440, Sept. 1980.
9. [9] J. N. Gray, “Notes on database operating systems,” in Operating Systems, An Advanced Course (Lecture Notes in Computer Science 60). Berlin, Germany: Springer-Verlag, 1978, pp. 398–481.
10. [10] R. C. Holt, “Some deadlock properties of computer systems,” ACM Comput. Surveys, vol. 4, pp. 179–195, Dec. 1972.
11. [11] L. Lamport, “Time, clocks and ordering of events in a distributed system,” Commun. ACM, vol. 21, pp. 558–565, July 1978.
12. [12] D. A. Menasce and R. R. Muntz, “Locking and deadlock detection in distributed databases,” IEEE Trans. Software Eng., vol. SE-5, pp. 195–202, May 1979.
13. [13] J.E.B. Moss, “Nested transactions: An approach to reliable distributed computing,” Lab. Comput. Sci., Massachusetts Inst. Technol., Cambridge, MA, Tech. Rep. 260, Apr. 1981.
14. [14] N. Natarajan, “Communication and synchronization in distributed programs,” Ph.D. dissertation, National Centre for Software Development and Computing Techniques, Tata Inst. Fundamental Res., Bombay, India, Nov. 1983.
15. [15] R. Obermarck, “Distributed deadlock detection algorithm,” ACM Trans. Database Syst., vol. 7, pp. 187–208, June 1982.
16. [16] D. J. Rosenkrantz, R. E. Stearns, and P.M. Lewis, “System level concurrency control for distributed database systems,” ACM Trans Database Syst., vol. 3, pp. 178–198, June 1978.