Genetic algorithm calibration for two objective scheduling parallel jobs on hierarchical grids

  • Authors:
  • Victor Hugo Yaurima-Basaldua;Andrei Tchernykh;Yair Castro-Garcia;Victor Manuel Villagomez-Ramos;Larisa Burtseva

  • Affiliations:
  • CESUES Superior Studies Center, San Luis, R.C., Mexico;CICESE Research Center, Ensenada, Mexico;Autonomous University of Baja California, Mexicali, Mexico;CESUES Superior Studies Center, San Luis, R.C., Mexico;Autonomous University of Baja California, Mexicali, Mexico

  • Venue:
  • PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses non-preemptive offline scheduling parallel jobs on a Grid. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable Grid site, while at the second stage, local scheduling is independently applied to each site. In this environment, one of the big challenges is to provide a job allocation that allows more efficient use of resources and user satisfaction. In general, the criteria that help achieve these goals are often in conflict. To solve this problem, two-objective genetic algorithm is proposed. We conduct comparative analysis of five crossover and three mutation operators, and determine most influential parameters and operators. To this end multi factorial analysis of variance is applied.