Recovery of N process deadlock using auction theory

The problem in increasing importance in design large multiprogramming system is the deadlock that is, two or more task is unable to proceed in scenario where each task monopolizing resources and waiting for the release of resources currently need by other in that group. In this paper we give the mechanism for deadlock recovery where finite processes are in deadlock while demanding the multiple identical instances of same resource type. We use VCG truthful auction mechanism in our proposed scheme by assuming that `N´ numbers of processes are in deadlock and act as bidders, put sealed bid and take participation in auction with independent private values to acquire the resources form auctioneer. We provide an efficient algorithm to resolve starvation problem has polynomial time complexity.