Artificial life techniques for load balancing in computational grids

  • Authors:

  • Riky Subrata;Albert Y. Zomaya;Bjorn Landfeldt

  • Affiliations:

  • Advanced Networks Research Group, School of Information Technologies, University of Sydney, NSW 2006, Australia;Advanced Networks Research Group, School of Information Technologies, University of Sydney, NSW 2006, Australia;Advanced Networks Research Group, School of Information Technologies, University of Sydney, NSW 2006, Australia

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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 and communication links, as well as background workloads that may be present in the computing nodes. 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. Artificial life techniques have been used to solve a wide range of complex problems in recent times. The power of these techniques stems from their capability in searching large search spaces, which arise in many combinatorial optimization problems, very efficiently. This paper studies several well-known artificial life techniques to gauge their suitability for solving grid load balancing problems. Due to their popularity and robustness, a genetic algorithm (GA) and tabu search (TS) are used to solve the grid load balancing problem. The effectiveness of each algorithm is shown for a number of test problems, especially when prediction information is not fully accurate. Performance comparisons with Min-min, Max-min, and Sufferage are also discussed.