Author's Personal Copy Future Generation Computer Systems an Auction Method for Resource Allocation in Computational Grids

A computational grid is composed of a set of resource consumers and resources providers. Usually these entities are independent and making decisions autonomously based on their policies and resource allocation in such systems is a challenging problem. In such systems using market-like techniques for this problem regulates the supply and demand for resources, provides an incentive for providers, and motivates the users to trade-off between deadline, budget, and the required level of quality of service. In this paper, we introduce a continuous double auction method (CDA) for grid resource allocation in which resources are considered as provider agents and users as consumer agents. In our proposed method these entities are allowed to participate in a grid independently and make decisions autonomously. We study this method in terms of economic efficiency and system performance. Experimental results illustrate that the proposed method is efficient in terms of successful execution rates, resource utilization rates and fair profit allocation.

[1]  Rajkumar Buyya,et al.  Time and cost trade-off management for scheduling parallel applications on Utility Grids , 2010, Future Gener. Comput. Syst..

[2]  Zhiwei Xu,et al.  Incentive-Based Scheduling for Market-Like Computational Grids , 2008, IEEE Transactions on Parallel and Distributed Systems.

[3]  Hong Peng,et al.  Macroeconomics based Grid resource allocation , 2008, Future Gener. Comput. Syst..

[4]  Yuhui Qiu,et al.  Resource trading using cognitive agents: A hybrid perspective and its simulation , 2007, Future Gener. Comput. Syst..

[5]  Arobinda Gupta,et al.  Auction Based Resource Allocation in Grids , 2006, ICDCN.

[6]  Lucio Grandinetti,et al.  Auction algorithms for decentralized parallel machine scheduling , 2006, Parallel Comput..

[7]  Daniel Grosu,et al.  Combinatorial auction-based protocols for resource allocation in grids , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[8]  Nicholas R. Jennings,et al.  An adaptive bidding agent for multiple English auctions: a neuro-fuzzy approach , 2004, 2004 IEEE International Conference on Fuzzy Systems (IEEE Cat. No.04CH37542).

[9]  Nicholas R. Jennings,et al.  Developing a bidding agent for multiple heterogeneous auctions , 2003, TOIT.

[10]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[11]  David Abramson,et al.  A Computational Economy for Grid Computing and its Implementation in the Nimrod-G Resource Brok , 2001, Future Gener. Comput. Syst..

[12]  Richard Wolski,et al.  Analyzing Market-Based Resource Allocation Strategies for the Computational Grid , 2001, Int. J. High Perform. Comput. Appl..

[13]  Makoto Yokoo,et al.  Robust double auction protocol against false-name bids , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[14]  Andrew S. Grimshaw,et al.  The Legion vision of a worldwide virtual computer , 1997, Commun. ACM.

[15]  R. McAfee,et al.  A dominant strategy double auction , 1992 .

[16]  M. D. Leenheer,et al.  Multi-cost job routing and scheduling in Grid networks , 2008 .

[17]  Stephen A. Jarvis,et al.  Grid load balancing using intelligent agents , 2005, Future Gener. Comput. Syst..

[18]  Daniel Grosu,et al.  AUCTION-BASED RESOURCE ALLOCATION PROTOCOLS IN GRIDS , 2004 .

[19]  Michael Schroeder,et al.  Market-based Resource Allocation for Grid Computing: A Model and Simulation , 2003, Middleware Workshops.