Towards decentralized load balancing in a computational grid environment

  • Authors:
  • Kai Lu;Riky Subrata;Albert Y. Zomaya

  • Affiliations:
  • Networks & Systems Lab, School of Information Technologies, University of Sydney, NSW, Australia;Networks & Systems Lab, School of Information Technologies, University of Sydney, NSW, Australia;Networks & Systems Lab, School of Information Technologies, University of Sydney, NSW, Australia

  • Venue:
  • GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Load balancing has been a key concern for locally distributed multiprocessor systems. The emergence of computational grid extends this problem, such as scalability, heterogeneity of computing resources and considerable communication delay. In this paper, we study the problem of scheduling a large number of CPU-intensive jobs on such systems. The time spent by a job in the system is considered as the main issue that needs to be minimized. The proposed dynamic algorithm of scheduling jobs consists of two policies: Instantaneous Distribution Policy (IDP) and Load Adjustment Policy (LAP). Our algorithm does not address directly the load balancing problem since it is completely unrealistic in such large environments, but we will show that even a non-perfectly load balanced system can behave reasonably well by taking into account the jobs' time demands. The proposed algorithm is evaluated by a series of simulations.