Abstract

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.