Subscribe

Issue No.01 - January (2008 vol.19)

pp: 66-76

ABSTRACT

Load balancing is a very important and complex problem in computational grids. A computational grid differs from traditional high performance computing systems in the heterogeneity of the computing nodes as well as the communication links that connect the different nodes together. There is a need to develop algorithms that could capture this complexity yet can be easily implemented and used to solve a wide range of load balancing scenarios. In this paper, we propose a game theoretic solution to the grid load balancing problem. The algorithm developed combines the inherent efficiency of the centralized approach, and the fault-tolerant nature of the distributed, decentralized approach. We model the grid load-balancing problem as a non-cooperative game whereby the objective is to reach the Nash equilibrium. Experiments were conducted to show the applicability of the proposed approaches. One advantage of our scheme is the relatively low overhead and robust performance against inaccuracies in performance prediction information.

INDEX TERMS

Game Theory, Grid Computing, Load Balancing, Scheduling

CITATION

Riky Subrata, Albert Y. Zomaya, Bjorn Landfeldt, "Game-Theoretic Approach for Load Balancing in Computational Grids",

*IEEE Transactions on Parallel & Distributed Systems*, vol.19, no. 1, pp. 66-76, January 2008, doi:10.1109/TPDS.2007.70710REFERENCES