A Tabu search algorithm for scheduling independent jobs in computational grids

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...

Descripción completa

Detalles Bibliográficos
Autores: Xhafa Xhafa, Fatos|||0000-0001-6569-5497, Carretero Casado, Javier Sebastián, Dorronsoro, Bernabé, Alba, Enrique
Tipo de recurso: artículo
Fecha de publicación:2009
País:España
Institución: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/130002
Acceso en línea:https://hdl.handle.net/2117/130002
Access Level:acceso abierto
Palabra clave:Computational grids (Computer systems)
Computer algorithms
Job scheduling
Computational grid
Tabu search
Computació distribuïda
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
id ES_db78000deb9ec986f9cda2ca76d9cf83
oai_identifier_str oai:upcommons.upc.edu:2117/130002
network_acronym_str ES
network_name_str España
repository_id_str
spelling A Tabu search algorithm for scheduling independent jobs in computational gridsXhafa Xhafa, Fatos|||0000-0001-6569-5497Carretero Casado, Javier SebastiánDorronsoro, BernabéAlba, EnriqueComputational grids (Computer systems)Computer algorithmsJob schedulingComputational gridTabu searchComputació distribuïdaAlgorismes computacionalsÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdesThe 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.Peer Reviewed20092009-01-0120192019-03-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/130002reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1300022026-05-27T15:37:01Z
dc.title.none.fl_str_mv A Tabu search algorithm for scheduling independent jobs in computational grids
title A Tabu search algorithm for scheduling independent jobs in computational grids
spellingShingle A Tabu search algorithm for scheduling independent jobs in computational grids
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Computational grids (Computer systems)
Computer algorithms
Job scheduling
Computational grid
Tabu search
Computació distribuïda
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
title_short A Tabu search algorithm for scheduling independent jobs in computational grids
title_full A Tabu search algorithm for scheduling independent jobs in computational grids
title_fullStr A Tabu search algorithm for scheduling independent jobs in computational grids
title_full_unstemmed A Tabu search algorithm for scheduling independent jobs in computational grids
title_sort A Tabu search algorithm for scheduling independent jobs in computational grids
dc.creator.none.fl_str_mv Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Carretero Casado, Javier Sebastián
Dorronsoro, Bernabé
Alba, Enrique
author Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author_facet Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Carretero Casado, Javier Sebastián
Dorronsoro, Bernabé
Alba, Enrique
author_role author
author2 Carretero Casado, Javier Sebastián
Dorronsoro, Bernabé
Alba, Enrique
author2_role author
author
author
dc.subject.none.fl_str_mv Computational grids (Computer systems)
Computer algorithms
Job scheduling
Computational grid
Tabu search
Computació distribuïda
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
topic Computational grids (Computer systems)
Computer algorithms
Job scheduling
Computational grid
Tabu search
Computació distribuïda
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
description 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.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-01-01
2019
2019-03-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/130002
url https://hdl.handle.net/2117/130002
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869421678478491648
score 15,300724

Similares en LA Referencia