Heterogeneous computing scheduling with evolutionary algorithms

Authors:
Sergio Nesmachnow;Héctor Cancela;Enrique Alba
Affiliations:
Universidad de la República, Montevideo, Uruguay;Universidad de la República, Montevideo, Uruguay;Universidad de Málaga, Málaga, Spain
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2010

Citing 0
Cited 6

A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks

Journal of Parallel and Distributed Computing
A parallel micro evolutionary algorithm for heterogeneous computing and grid scheduling

Applied Soft Computing
Benchmarking CHC on a new application: the software project scheduling problem

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Multiobjective grid scheduling using a domain decomposition based parallel micro evolutionary algorithm

International Journal of Grid and Utility Computing
Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems

Computational Optimization and Applications
A two-phase heuristic for the energy-efficient scheduling of independent tasks on computational grids

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents sequential and parallel evolutionary algorithms (EAs) applied to the scheduling problem in heterogeneous computing environments, a NP-hard problem with capital relevance in distributed computing. These methods have been specifically designed to provide accurate and efficient solutions by using simple operators that allow them to be later extended for solving realistic problem instances arising in distributed heterogeneous computing (HC) and grid systems. The EAs were codified over MALLBA, a general-purpose library for combinatorial optimization. Efficient numerical results are reported in the experimental analysis performed on well-known problem instances. The comparative study of scheduling methods shows that the parallel versions of the implemented evolutionary algorithms are able to achieve high problem solving efficacy, outperforming traditional scheduling heuristics and also improving over previous results already reported in the related literature.