A DISTRIBUTED SCHEME FOR DYNAMIC DEADLOCK DETECTION AND RESOLUTION

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.