An efficient distributed method for allocating resources based on an unobstructed squeezing technique

Abstract

The distributed resource allocation problem is one of important problems in distributed environment. In some applications where a resource is required by many processes at a time, some kinds of resources, such as a memory, a disk, or a communication channel can be divided into many units, which can be allocated to more than one process in the same time according to their requested amounts for the resource. In this paper, in order to use such kind of resources efficiently, we propose a new method for allocating the resources, by employing a "unobstructed squeezing" technique. By this method, a process with lower priority may acquire requested units, before another process with higher priority, if this allocation to the latter will not be delayed. A simulation shows that the performance of our method will be about 30% better than the traditional method for h-out-of-k problem (without squeezing), when each resource has large number of units and the number of requests for the resource is large enough.