Hybrid algorithms for independent batch scheduling in grids
Grid computing has emerged as a wide area distributed paradigm for solving large-scale problems in science, engineering, etc. and is known as the family of eScience grid-enabled applications. Computing planning of incoming jobs efficiently with available machines in the grid system is the main requi...
| Autores: | , , , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2012 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/127858 |
| Acesso em linha: | https://hdl.handle.net/2117/127858 https://dx.doi.org/10.1504/IJWGS.2012.048402 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computational grids (Computer systems) Genetic algorithms Fl owtime GAs Hierarchic optimisation Hybridisation Makespan Meta-heuristics Simultaneous optimisation Tabu search TS Computació distribuïda Algorismes genètics Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | Grid computing has emerged as a wide area distributed paradigm for solving large-scale problems in science, engineering, etc. and is known as the family of eScience grid-enabled applications. Computing planning of incoming jobs efficiently with available machines in the grid system is the main requirement for optimised system performance. One version of the problem is that of independent batch scheduling, in which jobs are assumed to be independent and are scheduled in batches aimed at minimising the makespan and flowtime. Given the hardness of the problem, heuristics are used to find high quality solutions for practical purposes of designing efficient grid schedulers. Recently, considerable efforts were spent in implementing and evaluating not only stand-alone heuristics and meta-heuristics, but also their hybridisation into even higher level algorithms. In this paper, we present a study on the performance of two popular algorithms for the problem, namely Genetic Algorithms (GAs) and Tabu Search (TS) and two hybridisations involving them, namely, the GA (TS) and GA-TS, which differ in the way the main control and cooperation among GA and TS are implemented. The hierarchic and simultaneous optimisation modes are considered for the bi-objective scheduling problem. Evaluation is done using different grid scenarios generated by a grid simulator. The computational results showed that the hybrid algorithm outperforms both the GA and TS for the makespan parameter, but not for the flowtime parameter. |
|---|