Grid Process Scheduling Optimization using the Tabu Search
Autor(a) principal: | |
---|---|
Data de Publicação: | 2010 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/313 |
Resumo: | Process scheduling problems present a large solution space, which exponentially increases according to the number of computers and processes. In this context, exact approaches are, therefore, infeasible. This limitation motivated several works to consider meta-heuristics to optimize the search for good solutions. In that sense, this work proposes a new approach based on the Tabu Search to improve process scheduling by considering application knowledge and the logical partitioning of distributed environments. Such knowledge comprises historical application events (captured during execution) which allow a better parametrization of the optimizer and, consequently, generates better results. Simulation results confirm the contributions of this new approach, which outperforms other techniques when dealing with large and heterogeneous environments, such as Grids. |
id |
UFLA-5_691aa29e90c294c601cd356c58fd5c58 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/313 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Grid Process Scheduling Optimization using the Tabu SearchProcess schedulingMeta-heuristicsTabu SearchGrid computingCluster computingProcess scheduling problems present a large solution space, which exponentially increases according to the number of computers and processes. In this context, exact approaches are, therefore, infeasible. This limitation motivated several works to consider meta-heuristics to optimize the search for good solutions. In that sense, this work proposes a new approach based on the Tabu Search to improve process scheduling by considering application knowledge and the logical partitioning of distributed environments. Such knowledge comprises historical application events (captured during execution) which allow a better parametrization of the optimizer and, consequently, generates better results. Simulation results confirm the contributions of this new approach, which outperforms other techniques when dealing with large and heterogeneous environments, such as Grids.Editora da UFLA2010-09-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/313INFOCOMP Journal of Computer Science; Vol. 9 No. 3 (2010): September, 2010; 61-751982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/313/298Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessEberle, André M.Mello, Rodrigo F. de2015-07-29T11:44:04Zoai:infocomp.dcc.ufla.br:article/313Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:31.297922INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Grid Process Scheduling Optimization using the Tabu Search |
title |
Grid Process Scheduling Optimization using the Tabu Search |
spellingShingle |
Grid Process Scheduling Optimization using the Tabu Search Eberle, André M. Process scheduling Meta-heuristics Tabu Search Grid computing Cluster computing |
title_short |
Grid Process Scheduling Optimization using the Tabu Search |
title_full |
Grid Process Scheduling Optimization using the Tabu Search |
title_fullStr |
Grid Process Scheduling Optimization using the Tabu Search |
title_full_unstemmed |
Grid Process Scheduling Optimization using the Tabu Search |
title_sort |
Grid Process Scheduling Optimization using the Tabu Search |
author |
Eberle, André M. |
author_facet |
Eberle, André M. Mello, Rodrigo F. de |
author_role |
author |
author2 |
Mello, Rodrigo F. de |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Eberle, André M. Mello, Rodrigo F. de |
dc.subject.por.fl_str_mv |
Process scheduling Meta-heuristics Tabu Search Grid computing Cluster computing |
topic |
Process scheduling Meta-heuristics Tabu Search Grid computing Cluster computing |
description |
Process scheduling problems present a large solution space, which exponentially increases according to the number of computers and processes. In this context, exact approaches are, therefore, infeasible. This limitation motivated several works to consider meta-heuristics to optimize the search for good solutions. In that sense, this work proposes a new approach based on the Tabu Search to improve process scheduling by considering application knowledge and the logical partitioning of distributed environments. Such knowledge comprises historical application events (captured during execution) which allow a better parametrization of the optimizer and, consequently, generates better results. Simulation results confirm the contributions of this new approach, which outperforms other techniques when dealing with large and heterogeneous environments, such as Grids. |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-09-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/313 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/313 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/313/298 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 9 No. 3 (2010): September, 2010; 61-75 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740961148928 |