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

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Yaurima-Basaldua, V. H., Tchernykh, A., Castro-Garcia, Y., Villagomez-Ramos, V. M., & Burtseva, L. (2012). Genetic algorithm calibration for two objective scheduling parallel jobs on hierarchical grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7204 LNCS, pp. 61–70). https://doi.org/10.1007/978-3-642-31500-8_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free