Genetic Algorithm Based Scheduler for Computational Grids

  • Authors:
  • Mona Aggarwal;Robert D. Kent;Alioune Ngom

  • Affiliations:
  • University of Windsor;University of Windsor;University of Windsor

  • Venue:
  • HPCS '05 Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the context of highly scalable distributed resource management architectures for grid computing, we present a Genetic Algorithm based scheduler. A scheduler must use the available resources efficiently, while satisfying competing and mutually conflicting goals. The grid workload may consist of multiple jobs, with quality-of-service constraints. A Directed Acyclic Graph (DAG) represents each job, taking into account arbitrary precedence constraints and arbitrary processing time. The scheduler has been designed to be compatible with other tools being developed by our grid research group. We present the design, implementation and test results for such a scheduler in which we minimize make-span, idle time of the available computational resources, turn-around time and the specified deadlines provided by users. The architecture is hierarchical and the scheduler is usable at either the lowest or the higher tiers. It can also be used in both the intra-grid of a large organization and in a research grid consisting of large clusters, connected through a high bandwidth dedicated network.