A Resource Allocation Method for Computational Grids Based on On-line Reverse Auction

Resource allocation and task scheduling are two key technologies in grid computing system. The market-based resource allocation model is considered as a good one. In this paper, an on-line reverse auction method of resource allocation for computational grids was proposed to solve the problem of resource management considering the dynamic characteristics of computing resources in the computational grid environment and the advantages of economics mechanism. In this method, the current price can be set using former bids. And bidders arriving one by one the on-line buyer must be required to make a decision immediately about each bid as it is received. Then we prove that the algorithm is incentive compatible and simulate the auction protocol in Gridsim to evaluate its communication demand.

[1]  Rajkumar Buyya,et al.  AN EVALUATION OF COMMUNICATION DEMAND OF AUCTION PROTOCOLS IN GRID ENVIRONMENTS , 2006 .

[2]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Scalable Comput. Pract. Exp..

[3]  Peter Merz,et al.  Formal Verification of a Grid Resource Allocation Protocol , 2008, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID).

[4]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[5]  Yucheng Dong,et al.  Competitive algorithms about online reverse auctions , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[6]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[7]  Rajkumar Buyya,et al.  Grids and Grid technologies for wide‐area distributed computing , 2002, Softw. Pract. Exp..