A hybrid load balancing algorithm for coarse-grained applications

  • Authors:
  • Aggarwal Akshai;Gan Xinyu

  • Affiliations:
  • School of Computer Science, University of Windsor, Windsor, Ontario, Canada;School of Computer Science, University of Windsor, Windsor, Ontario, Canada

  • Venue:
  • ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A non-preemptive hybrid load balancing algorithm is proposed for heterogeneous distributed computing environment. The hybrid model initially classifies the compute elements and jobs into different types. The algorithm maps the tasks of various jobs onto compute elements of the same type. Based on historical experience, the centralized load balancer can dynamically change the parameters in order to improve the overall performance during runtime. The algorithm balances the work load of coarse-grained applications with interdependent processes. Its working has been compared with other similar algorithms by extensive testing on a test-bed. The Hybrid Load Balancing algorithm is found to give consistently better results.