Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/130002

Título:	A Tabu search algorithm for scheduling independent jobs in computational grids
Autor/a:	Xhafa Xhafa, Fatos; Carretero Casado, Javier Sebastián; Dorronsoro, Bernabé; Alba, Enrique
Otros autores:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Abstract:	The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications, and it is a computationally hard problem even when there are no dependencies among jobs. We present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We define it as a bi-objective optimization problem, consisting of the minimization of the makespan and flowtime. Our TS is validated versus three other algorithms in the literature for a classical benchmark. We additionally consider some more realistic benchmarks with larger size instances in static and dynamic environments. We show that our TS clearly outperforms the compared algorithms.
Abstract:	Peer Reviewed
Materia(s):	-Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes -Computational grids (Computer systems) -Computer algorithms -Job scheduling -Computational grid -Tabu search -Computació distribuïda -Algorismes computacionals
Derechos:
Tipo de documento:	Artículo - Versión publicada Artículo
Compartir:

Mostrar el registro completo del ítem