A distributed solution for detecting deadlock in distributed nested transaction systems
In systems where Nested Transactions are used, when a transaction commits, its locks are not released, they are inherited by its parent. Thus, the deadlock detection system must take nested transaction relationships into account or else some deadlocks cannot be detected. Besides, in the distributed Nested Transaction, it is not efficient neither to maintain nor to follow the edges of a global wait-for graph for the whole system. We propose a correct algorithm for detecting deadlocks in a distributed Nested Transaction. This algorithm does not require that the global wait-for graph be built and maintained nor that the edges of a global wait-for graph be followed in order for deadlocks to be detected.
Keywordsdistributed computation distributed databases distributed transactions nested transactions deadlocks
Unable to display preview. Download preview PDF.
- [Beer83]Beeri C, Bernstein P, Goodman N, Lai M and Shasha D (1983). A Concurrency Control Theory for Nested Transactions. Proc. 2nd ACM SIGACT SIGOPS Symposium on Principles of Distributed Computing.Google Scholar
- [Bern87]Bernstein P, Hadzilacos V and Goodman N (1987). Concurrency Control and Recovery in Database Systems. Addison Wesley Publishing Company.Google Scholar
- [Ceri84]Ceri S and Pelagatti G (1984). Distributed Database Principles and Systems. McGraw-Hill, New York.Google Scholar
- [Chan83]Chandy M, Misra J and Haas L (1983). Distributed Deadlock Detection. ACM Transactions on Computer Systems, Vol. No2, May 1983.Google Scholar
- [Muel83]Mueller E., Moore I., and Popek G., A Nested Transaction Mechanisme for LOCUS. Proc. of Operating Systems Principles. Bretton Woods NH. 1983Google Scholar
- [Moss85]Moss E (1985). Nested Transactions: An Approach to Reliable Distributed Computing. Research Reports and Notes Information System Series MIT press 1985.Google Scholar