The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2008 vol.19)
pp: 66-76
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.
Game Theory, Grid Computing, Load Balancing, Scheduling
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.70710
[1] M. Avvenuti, L. Rizzo, and L. Vicisano, “A Hybrid Approach to Adaptive Load Sharing and Its Performance,” J. Systems Architecture, vol. 42, pp. 679-696, 1997.
[2] N. Bansal and M. Harchol-Balter, “Analysis of SRPT Scheduling: Investigating Unfairness,” Proc. ACM Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '01), pp. 279-290, 2001.
[3] C. Boeres, A. Lima, and V.E.F. Rebello, “Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics,” Proc. 15th Symp. Computer Architecture and High Performance Computing, pp. 199-206, 2003.
[4] T. Boulogne, E. Altman, and O. Pourtallier, “On the Convergence to Nash Equilibrium in Problems of Distributed Computing,” Annals of Operation Research, pp. 279-291, 2002.
[5] H. Casanova and L. Marchal, “A Network Model for Simulation of Grid Application,” Research Report 2002-40, 2002.
[6] Y.C. Chow and W.H. Kohler, “Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System,” IEEE Trans. Computers, vol. 28, pp. 354-361, 1979.
[7] R.B. Cooper, Introduction to Queueing Theory, second ed. Elsevier, 1981.
[8] M.E. Crovella, M. Harchol-Balter, and C.D. Murta, “Task Assignment in a Distributed System: Improving Performance by Unbalancing Load,” Technical Report BUCS-TR-1997-018, 1997.
[9] I. Forster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1998.
[10] D. Grosu and A.T. Chronopoulos, “Noncooperative Load Balancing in Distributed Systems,” J. Parallel and Distributed Computing, vol. 65, pp. 1022-1034, 2005.
[11] M. Harchol-Balter, “Job Placement with Unknown Duration and No Preemption,” Performance Evaluation Rev., vol. 28, pp. 3-5, 2001.
[12] M. Harchol-Balter and A.B. Downey, “Exploiting Process Lifetime Distributions for Dynamic Load Balancing,” ACM Trans. Computer Systems, vol. 15, pp. 253-285, 1997.
[13] R. Jain, D. Chiu, and W. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems,” DEC Research Report TR-301, 1984.
[14] H. Kameda, J. Li, C. Kim, and Y. Zhang, Optimal Load Balancing in Distributed Computer Systems. Springer, 1997.
[15] C. Kim and H. Kameda, “An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems,” IEEE Trans. Computers, vol. 41, pp. 381-384, 1992.
[16] H.W. Kuhn and A.W. Tucker, “Nonlinear Programming,” Proc. Second Berkeley Symp. Math. Statistics and Probability, pp. 481-492, 1951.
[17] A. Legrand, L. Marchal, and H. Casanova, “Scheduling Distributed Applications: The SimGrid Simulation Framework,” Proc. Third IEEE/ACM Int'l Symp. Cluster Computing and the Grid, pp.138-145, 2003.
[18] H.-C. Lin and C.S. Raghavendra, “A Dynamic Load-Balancing Policy with a Central Job Dispatcher (LBC),” IEEE Trans. Software Eng., pp. 148-158, 1992.
[19] M.O. Lorenz, “Methods of Measuring the Concentration of Wealth,” Publications of the Am. Statistical Assoc., vol. 9, pp. 209-219, 1905.
[20] K. Lu, R. Subrata, and A.Y. Zomaya, “An Efficient Load Balancing Algorithm for Heterogeneous Grid Systems Considering Desirability of Grid Sites,” Proc. 25th IEEE Int'l Performance Computing and Comm. Conf. (IPCCC '06), 2006.
[21] K. Lu, R. Subrata, and A.Y. Zomaya, “Towards Decentralized Load Balancing in a Computational Grid Environment,” Proc. First Int'l Conf. Grid and Pervasive Computing (GPC '06), 2006.
[22] D.G. Luenberger, Linear and Nonlinear Programming, second ed. Addison-Wesley, 1984.
[23] A. Orda, R. Rom, and N. Shimkin, “Competitive Routing in Multiuser Communication Networks,” IEEE/ACM Trans. Networking, vol. 1, pp. 510-521, 1993.
[24] I.A. Rai, G. Urvoy-Keller, and E.W. Biersack, “Analysis of LAS Scheduling for Job Size Distributions with High Variance,” Proc. ACM Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '03), pp. 218-228, 2003.
[25] A. Riska, E. Smirni, and G. Ciardo, “Analytic Modeling of Load Balancing Policies for Tasks with Heavy-Tailed Distributions,” Proc. Second ACM Int'l Workshop Software and Performance (WOSP '00), pp. 147-157, 2000.
[26] N.G. Shivaratri, P. Krueger, and M. Singhal, “Load Distributing for Locally Distributed Systems,” Computer, pp. 33-44, 1992.
[27] R. Wolski, N.T. Spring, and J. Hayes, “The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing,” J. Future Generation Computer Systems, vol. 15, pp. 757-768, 1998.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool