Resource allocation optimization based on load forecast in computational grid

This paper presents a grid resource allocation strategy based on load forecast for optimizing user’s execution time in a proportional resource sharing environment. The problem of multiple users competing for computational resource is formulated as a multi-player game. The goal of each grid user is to complete its tasks as quickly as possible within the budget constraint. Through finding the Nash equilibrium solution, a profile of user optimal bid is produced to allocate resource. In particular, a load forecasting method for grid resource price is proposed using sequential game. The experimental results show that the proposed allocation based on load forecast using sequential game outperforms the allocations using other three forecasting methods in terms of resource processing time.

[1]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[2]  Tamer Basar,et al.  A game-theoretic formulation of multi-agent resource allocation , 2000, AGENTS '00.

[3]  Kuo-Ming Chao,et al.  Negotiating Agents in a Market-Oriented Grid , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[4]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[5]  Ratul Mahajan,et al.  Experiences applying game theory to system design , 2004, PINS '04.

[6]  Shanshan Song,et al.  Selfish grid computing: game-theoretic modeling and NAS performance results , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

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

[8]  Umesh Maheshwari,et al.  Charge-Based Proportional Scheduling , 1996 .

[9]  David Abramson,et al.  A case for economy grid architecture for service oriented grid computing , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[10]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

[11]  Anthony T. Chronopoulos,et al.  Algorithmic mechanism design for load balancing in distributed systems , 2002, Proceedings. IEEE International Conference on Cluster Computing.

[12]  Sajal K. Das,et al.  A game theory based pricing strategy for job allocation in mobile grids , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[13]  Layuan Li,et al.  Competitive proportional resource allocation policy for computational grid , 2004, Future Gener. Comput. Syst..

[14]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.

[15]  Jae C. Oh,et al.  GameMosix: Game-Theoretic Middleware for CPU Sharing in Untrusted P2P Environment , 2004, PDCS.

[16]  Muthucumaru Maheswaran,et al.  Towards a micro-economic model for resource allocation in Grid computing systems , 2002, IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373).

[17]  T. Başar,et al.  Nash Equilibrium and Decentralized Negotiation in Auctioning Divisible Resources , 2003 .

[18]  David Abramson,et al.  Economic models for management of resources in peer-to-peer and grid computing , 2001, SPIE ITCom.

[19]  David E. Culler,et al.  Market-based Proportional Resource Sharing for Clusters , 2000 .

[20]  Minglu Li,et al.  An economic-based resource management framework in the grid context , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..