A hierarchical adaptive distributed algorithm for load balancing

  • Authors:

  • K. Antonis;J. Garofalakis;I. Mourtos;P. Spirakis

  • Affiliations:

  • Technological and Educational Institute of Lamia, 3rd km Old National Road Lamia-Athens, Lamia, Greece;Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece and London School of Economics, Department of Operational Research, Houghton Street, WC2A 2AE London, UK;London School of Economics, Department of Operational Research, Houghton Street, WC2A 2AE London, UK;Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece and University of Patras, Department of Computer Engineering and Informatics, 26500 Rion, Patras, Greece

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Load balancing/sharing exploits the communication facility between the servers of a distributed system, by using the exchanging of status information and jobs between any two servers of the system in order to improve the overall performance. We propose an adaptive distributed hierarchical scheme, the Virtual Tree Algorithm (VTA), which creates a virtual binary tree structure over the actual network topology. It uses the difference-initiated (DI) technique for load balancing, which needs remote information for the transfer policy and no additional information for the location policy. We demonstrate that the introduced virtual construction keeps the exchanged messages to relatively low levels. To evaluate the performance of our policy, we present both theoretical and simulation results. By using simulation, we compare our results with one of the most representative, adaptive, symmetrical and efficient algorithms, the Variable Threshold (V_THR) algorithm.