Skip to Main Content
In multiprogramming environment, where two processes may compete for a finite number of instances of the same resource type, occurrence of deadlock between them is very usual situation. Key task is to get the appropriate recovery from deadlock such that every process get fair result and resources must not preempted from same process every time. This paper proposes a payoff matrix approach that resolve these bottleneck. Proposed algorithm can efficiently find an algorithm for deadlock recovery. In this paper two player zero sum game is played using mixed strategy mechanism, a probabilistic approach where two process are acting as players and environment is fair. The time complexity of proposed algorithm for recovering two process deadlock which hold the instances of same resource type is constant to recover from the deadlock.
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on (Volume:9 )
Date of Conference: 9-11 July 2010