A continuous double auction method for resource allocation in computational grids

Abstract

In this paper, we introduce a continuous double auction method for grid resource allocation in which resources are considered as provider agents and users as consumer agents. In each time step, each provider agent determines its requested value based on its workload and each consumer agent determines its bid value based on two constraints: the remaining time for bidding, and the remaining resources for bidding. We study this method in terms of economic efficiency and system performance. Experimental results show that the proposed method is better than earliest deadline first (EDF) method, which is a default strategy in many schedulers.