Research Article
Slowdown-Guided Genetic Algorithm for Job Scheduling in Federated Environments
@INPROCEEDINGS{10.1007/978-3-319-15392-6_18, author={Eloi Gabaldon and Josep Lerida and Fernando Guirado and Jordi Planes}, title={Slowdown-Guided Genetic Algorithm for Job Scheduling in Federated Environments}, proceedings={Nature of Computation and Communication. International Conference, ICTCC 2014, Ho Chi Minh City, Vietnam, November 24-25, 2014, Revised Selected Papers}, proceedings_a={ICTCC}, year={2015}, month={2}, keywords={Resource federation Scheduling Co-allocation Genetic Algorithms Slowdown-execution predictions}, doi={10.1007/978-3-319-15392-6_18} }- Eloi Gabaldon
Josep Lerida
Fernando Guirado
Jordi Planes
Year: 2015
Slowdown-Guided Genetic Algorithm for Job Scheduling in Federated Environments
ICTCC
ICST
DOI: 10.1007/978-3-319-15392-6_18
Abstract
Large-scale federated environments have emerged to meet the requirements of increasingly demanding scientific applications. However, the seemingly unlimited availability of computing resources and heterogeneity turns the scheduling into an NP-hard problem. Unlike exhaustive algorithms and deterministic heuristics, evolutionary algorithms have been shown appropriate for large-scheduling problems, obtaining near optimal solutions in a reasonable time. In the present work, we propose a Genetic Algorithm (GA) for scheduling job-packages of parallel task in resource federated environments. The main goal of the proposal is to determine the job schedule and package allocation to improve the application performance and system throughput. To address such a complex infrastructure, the GA is provided with knowledge based on slowdown predictions for the application runtime, obtained by considering heterogeneity and bandwidth issues. The proposed GA algorithm was tuned and evaluated using real workload traces and the results compared with a range of well-known heuristics in the literature.
