Abstract
A distributed scheme for dynamically detecting resource deadlocks is presented. The proposed scheme dynamically partitions the processes in the system into a set of groups and defines dependency relations between any two processes within a group (group information). This process grouping enables the detection of the deadlock without chasing all the edges of the cycle since the group information remains valid until it is updated again. Since the group information is updated during run-time, there is no separate detection phase in the proposed scheme and the deadlock is detected dynamically during run-time. The proposed scheme ensures that only one process in the cycle detects deadlock, which simplifies the process of deadlock resolution. The deadlock resolution rules that make the group information remain valid after the resolution of the deadlock are also presented. Performance of the proposed scheme is discussed through simulation.
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.
