A hyper-heuristic for adaptive scheduling in computational grids

In this paper we present the design and implementation of an hyper-heuristic for efficiently scheduling independent jobs in computational grids. An efficient scheduling of jobs to grid resources depends on many parameters, among others, the characteristics of the resources and jobs (such as computin...

Descripción completa

Detalles Bibliográficos
Autor: Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Tipo de recurso: artículo
Fecha de publicación:2007
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/129991
Acceso en línea:https://hdl.handle.net/2117/129991
Access Level:acceso abierto
Palabra clave:Computational grids (Computer systems)
Grid computing
Resource allocation
Scheduling
Computació distribuïda
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
id ES_0d77fc2adb2c8477b198f2eeee7dcd71
oai_identifier_str oai:upcommons.upc.edu:2117/129991
network_acronym_str ES
network_name_str España
repository_id_str
spelling A hyper-heuristic for adaptive scheduling in computational gridsXhafa Xhafa, Fatos|||0000-0001-6569-5497Computational grids (Computer systems)Grid computingResource allocationSchedulingComputació distribuïdaÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdesIn this paper we present the design and implementation of an hyper-heuristic for efficiently scheduling independent jobs in computational grids. An efficient scheduling of jobs to grid resources depends on many parameters, among others, the characteristics of the resources and jobs (such as computing capacity, consistency of computing, workload, etc.). Moreover, these characteristics change over time due to the dynamic nature of grid environment, therefore the planning of jobs to resources should be adaptively done. Existing ad hoc scheduling methods (batch and immediate mode) have shown their efficacy for certain types of resource and job characteristics. However, as stand alone methods, they are not able to produce the best planning of jobs to resources for different types of Grid resources and job characteristics. In this work we have designed and implemented a hyper-heuristic that uses a set of ad hoc (immediate and batch mode) scheduling methods to provide the scheduling of jobs to Grid resources according to the Grid and job characteristics. The hyper-heuristic is a high level algorithm, which examines the state and characteristics of the Grid system (jobs and resources), and selects and applies the ad hoc method that yields the best planning of jobs. The resulting hyper-heuristic based scheduler can be thus used to develop network-aware applications that need efficient planning of jobs to resources. The hyper-heuristic has been tested and evaluated in a dynamic setting through a prototype of a Grid simulator. The experimental evaluation showed the usefulness of the hyper-heuristic for planning of jobs to resources as compared to planning without knowledge of the resource and job characteristics.Peer Reviewed20072007-01-0120192019-03-01journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/129991reponame: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/1299912026-05-27T15:37:01Z
dc.title.none.fl_str_mv A hyper-heuristic for adaptive scheduling in computational grids
title A hyper-heuristic for adaptive scheduling in computational grids
spellingShingle A hyper-heuristic for adaptive scheduling in computational grids
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Computational grids (Computer systems)
Grid computing
Resource allocation
Scheduling
Computació distribuïda
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
title_short A hyper-heuristic for adaptive scheduling in computational grids
title_full A hyper-heuristic for adaptive scheduling in computational grids
title_fullStr A hyper-heuristic for adaptive scheduling in computational grids
title_full_unstemmed A hyper-heuristic for adaptive scheduling in computational grids
title_sort A hyper-heuristic for adaptive scheduling in computational grids
dc.creator.none.fl_str_mv Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author_facet Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author_role author
dc.subject.none.fl_str_mv Computational grids (Computer systems)
Grid computing
Resource allocation
Scheduling
Computació distribuïda
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
topic Computational grids (Computer systems)
Grid computing
Resource allocation
Scheduling
Computació distribuïda
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes
description In this paper we present the design and implementation of an hyper-heuristic for efficiently scheduling independent jobs in computational grids. An efficient scheduling of jobs to grid resources depends on many parameters, among others, the characteristics of the resources and jobs (such as computing capacity, consistency of computing, workload, etc.). Moreover, these characteristics change over time due to the dynamic nature of grid environment, therefore the planning of jobs to resources should be adaptively done. Existing ad hoc scheduling methods (batch and immediate mode) have shown their efficacy for certain types of resource and job characteristics. However, as stand alone methods, they are not able to produce the best planning of jobs to resources for different types of Grid resources and job characteristics. In this work we have designed and implemented a hyper-heuristic that uses a set of ad hoc (immediate and batch mode) scheduling methods to provide the scheduling of jobs to Grid resources according to the Grid and job characteristics. The hyper-heuristic is a high level algorithm, which examines the state and characteristics of the Grid system (jobs and resources), and selects and applies the ad hoc method that yields the best planning of jobs. The resulting hyper-heuristic based scheduler can be thus used to develop network-aware applications that need efficient planning of jobs to resources. The hyper-heuristic has been tested and evaluated in a dynamic setting through a prototype of a Grid simulator. The experimental evaluation showed the usefulness of the hyper-heuristic for planning of jobs to resources as compared to planning without knowledge of the resource and job characteristics.
publishDate 2007
dc.date.none.fl_str_mv 2007
2007-01-01
2019
2019-03-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/129991
url https://hdl.handle.net/2117/129991
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_ 1869403341674512384
score 15,300724

Similares en LA Referencia