Algorithmic approach to deadlock detection for resource allocation in heterogeneous platforms

An allocation of resources to a virtual machine specifies the maximum amount of each individual element of each resource type that will be utilized, as well as the aggregate amount of each resource of each type. An allocation is thus represented by two vectors, a maximum elementary allocation vector and an aggregate allocation vector. There are more general types of resource allocation problems than those we consider here. In this paper, we present an approach for improving parallel deadlock detection algorithm, to schedule the policies of resource which supply for resource allocation in heterogeneous distributed platform. Parallel deadlock detection algorithm has a run time complexity of O(min(m,n)), where m is the number of resources and n is the number of processes. We propose the algorithm for allocating multiple resources to competing services running in virtual machines on a heterogeneous distributed platform. The experiments also compare the performance of the proposed approach with other related work.