Premium
SCHEDULING IN HETEROGENEOUS COMPUTING AND GRID ENVIRONMENTS USING A PARALLEL CHC EVOLUTIONARY ALGORITHM
Author(s) -
Nesmachnow Sergio,
Alba Enrique,
Cancela Héctor
Publication year - 2012
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.2012.00410.x
Subject(s) - computer science , scalability , grid , grid computing , scheduling (production processes) , benchmark (surveying) , evolutionary algorithm , job shop scheduling , mathematical optimization , algorithm , distributed computing , parallel computing , mathematics , schedule , artificial intelligence , geometry , geodesy , database , geography , operating system
Scheduling is a capital problem when using distributed heterogeneous computing (HC) and grid environments to solve complex problems. The scheduling problem in heterogeneous environments is NP‐hard, so a significant effort has been made to develop efficient methods for solving the problem. However, few works have faced realistic grid‐sized problem instances. This work presents a parallel CHC (pCHC) evolutionary algorithm codified over MALLBA, a general‐purpose library for combinatorial optimization, for solving the scheduling problem in HC and grid environments. Efficient numerical results are reported in the experimental analysis performed on both a standard benchmark and a set of large‐sized problem instances specially designed in this work. The comparative study shows that pCHC is able to achieve high problem solving efficacy, significantly improving over traditional deterministic scheduling methods, while also showing a good scalability behavior when solving large problem instances.