An Algorithmic Approach for Deadlock Detection in Hypervisor

A Deadlock is a state in which a process waits for the resource that is being held by another process. The processes will be blocked completely and it doesn’t lead to any progress. Many of the present algorithms take polynomial time only to detect the deadlock. The proposed algorithm provides an approach to detect and recover from the deadlock in linear time complexity. The algorithm shows a one-to-one correspondence to the figures formed using the Penrose Geometry. The algorithm can detect the deadlock without ambiguity even if the resources with multiple instances are involved.