Abstract
A deadlock detection algorithm for the highly parallel nested transactions, which is based on edge-chasing method, is presented. Considering nested structures of transactions is essential for detecting a deadlock correctly in nested transactions, since a waiting relationship between two transactions is not always made directly. Since probes do not need to traverse a transaction tree to detect deadlocks in our detection algorithm, our algorithm can detect deadlocks with a constant message passing overhead regardless of the depth of nesting in a transaction hierarchy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
