Lehrgebiet Informationssysteme

FB Informatik

LG IS

AG DBIS

(C) AG DBIS

Detection Arcs for Deadlock Management in Nested Transactions and their Performance

Fernando de Ferreira Rezende, Theo Härder, Andreas Gloeckner, Jörg Lutze

University of Kaiserslautern
P.O. Box 3049, 67653 Kaiserslautern, Germany
e-mail: haerder@informatik.uni-kl.de

Full paper (postscript version compressed by gzip)

Abstract:

In this paper, we address deadlock management in nested transactions. In our strategy, deadlocks are detected through the occurrence of cycles in a waits-for graph (WFG). However, the process of looking for cycles in the WFG considering all its nodes and edges can be very time-consuming. To accelerate this process, we propose the detection arcs. In essence, a detection arc represents a higher level abstraction embodying a hidden waiting relation between two trans actions that is caused by a lock wait. Thus, the deadlock detection process needs to traverse only a minimal subset of the WFG's edges when it is started, the set of detection arcs. Therefore, the overall performance of deadlock management is improved, as confirmed by our performance measurements.

Published in Advances of Databases, LNCS 1271, Springer, 1997, pp. 54-68.