Adaptive dynamic load-balancing through evolutionary formation of coalitions

  • Authors:
  • Leland Hovey;Dmitri E. Volper;Jae C. Oh

  • Affiliations:
  • Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY;Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY;Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY

  • Venue:
  • Design and application of hybrid intelligent systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

We study coalition formation for adaptive dynamic processor load-balancing in distributed systems. The compute nodes are rational agents that are constantly trying to minimize the difference of their CPU loads from the average load of nodes in the vicinity. Each agent uses a game-like evolutionary process to adjust its load by distributing jobs to neighboring nodes and by joining or forming a coalition. Since agents only communicate with their neighbors, the communication cost involved in sharing the load-information with others is greatly reduced while optimal load-balancing is achieved.