Abstract
A distributed algorithm is presented for deadlock detection and resolution in distributed systems. The unique feature of the proposed algorithm is that it detects and resolves all deadlocks reachable from the initiator of the algorithm using 2 n time units and 2 e messages, where n and e are the number of nodes and edges in the wait-for graph reachable from the initiator, respectively. A simple analysis shows that our scheme allows less number of algorithm initiations throughout the system and faster deadlock detection.
Sign-in/Register to access full text options 
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.
