Abstract
In this paper, we propose an algorithm for detecting deadlocks in a distributed Nested Transaction. This algorthms 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. Our algorithm uses the fact that transactions are organized in a tree structure. Each transaction maintains a representative wait-for graph that summarizes the waiting conditions in the subtree below the transaction. Deadlocks can be detected by individually checking these condensed wait-for graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beeri C, Bernstein P, Goodman N, Lai M, Shasha D: A concurrency control theory for Nested Transactions. Proc 2nd ACM SIGACT SIGOPS Symp on Principles of Distributed Computing (1983)
Bernsein P, Hadzilacos V, Goodman N: Concurrency control and recovery in database systems. Addison Wesley, USA 1987
Ceri S, Pelagatti G: Distributed database principles and systems. McGraw-Hill, New York 1984
Chandy M, Misra J, Haas L: Distributed deadlock detection. ACM Trans Comput Syst 2:144–156 (1983)
Lynch N, Merritt M: Introduction to the theory of nested transactions. International Conference on Database Theory. Rome, Italy, 1986
Mueller E, Moore J, Popek G: A Nested Transaction Mechanism for LOCUS. Proc. of Operating Systems Principles. Bretton Woods NH, 1983
Moss, E: Nested Transactions: an approach to reliable distributed computing. Res Rep Notes Inf Syst Cambridge, Mass. MIT Press, Cambridge, Mass. 1985
Spector A, Butcher J, Daniels D, Duchamp D, Eppinger J, Fineman C, Heddaya A: Support for distributed transactions in the TABS prototype. IEEE Trans Software Eng SE 11(6):520–530 (1985)
Author information
Authors and Affiliations
Additional information
Marta Rukoz received an under-graduate degree in Computer Science from the Central University of Venezuela in 1981, a Masters degree from Simon Bolivar University in 1985, and a Ph.D. from the Pierre et Marie Curie, Paris VI University in France. She was a member of the faculty at the Central University of Venezuela from 1982–1985 and returned in 1989 where she is currently a Professor Agregado. From 1987–1989 she worked at the University of Paris Nord. Professor Rukoz's research interests include: distributed algorithms, distributed databases, and Petri net models.
A preliminary draft of this paper appears in Bermond J, Raynal M (eds) Proceedings of distributed algorithms. Lect Notes Comput Sci. vol. 392. Springer, Berlin Heidelberg New York, 1989
Rights and permissions
About this article
Cite this article
Rukoz, M. Hierarchical deablock detection for nested transactions. Distrib Comput 4, 123–129 (1991). https://doi.org/10.1007/BF01798959
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01798959