An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments
Autor(a) principal: | |
---|---|
Data de Publicação: | 2011 |
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/332 |
Resumo: | The data Grid, a class of Grid Computing, aims at providing services and infrastructure to data-intensive distributed applications which need to access, transfer and modify large data storages. A common issue on Data Grids is the data access optimization, which has been addressed through different approaches such as bio-inspired and replication strategies. However, few of those approaches consider application features to optimize data access operations (read-and-write). Those features define the application behavior, which supports the optimization of operations, consequently, improving the overall system performance. Motivated by the need of efficient data access in large scale distributed environments and by the affordable improvements of application characteristics, this paper proposes a new heuristic to optimize data access operations based on historical behavior of applications. Throughout experiments we concluded that applications are better optimized by anticipating different numbers of future events, which vary over the execution. Then, in order to address such issue, we proposed an adaptive sliding window which automatically and dynamically defines how many future operations must be considered to improve the overall application performance. Simulations were conducted using the OptorSim simulator, which is commonly considered in this research field. Our experimental evaluation confirms that the proposed heuristic reduces application execution times up to 50% when compared to other approaches. |
id |
UFLA-5_f78da755b4c643ab3a8c03a3adbd8efb |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/332 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environmentsdata access optimizationgrid computingcluster computingoptimization algorithmsresource allocationmodeling and simulationThe data Grid, a class of Grid Computing, aims at providing services and infrastructure to data-intensive distributed applications which need to access, transfer and modify large data storages. A common issue on Data Grids is the data access optimization, which has been addressed through different approaches such as bio-inspired and replication strategies. However, few of those approaches consider application features to optimize data access operations (read-and-write). Those features define the application behavior, which supports the optimization of operations, consequently, improving the overall system performance. Motivated by the need of efficient data access in large scale distributed environments and by the affordable improvements of application characteristics, this paper proposes a new heuristic to optimize data access operations based on historical behavior of applications. Throughout experiments we concluded that applications are better optimized by anticipating different numbers of future events, which vary over the execution. Then, in order to address such issue, we proposed an adaptive sliding window which automatically and dynamically defines how many future operations must be considered to improve the overall application performance. Simulations were conducted using the OptorSim simulator, which is commonly considered in this research field. Our experimental evaluation confirms that the proposed heuristic reduces application execution times up to 50% when compared to other approaches.Editora da UFLA2011-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/332INFOCOMP Journal of Computer Science; Vol. 10 No. 2 (2011): June, 2011; 26-431982-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/332/316Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessIshii, Renato Porfiriode Mello, Rodrigo Fernandes2015-07-29T11:56:48Zoai:infocomp.dcc.ufla.br:article/332Revistahttps://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:32.442335INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments |
title |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments |
spellingShingle |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments Ishii, Renato Porfirio data access optimization grid computing cluster computing optimization algorithms resource allocation modeling and simulation |
title_short |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments |
title_full |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments |
title_fullStr |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments |
title_full_unstemmed |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments |
title_sort |
An Adaptive and Historical Approach to Optimize Data Access in Grid Computing Environments |
author |
Ishii, Renato Porfirio |
author_facet |
Ishii, Renato Porfirio de Mello, Rodrigo Fernandes |
author_role |
author |
author2 |
de Mello, Rodrigo Fernandes |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Ishii, Renato Porfirio de Mello, Rodrigo Fernandes |
dc.subject.por.fl_str_mv |
data access optimization grid computing cluster computing optimization algorithms resource allocation modeling and simulation |
topic |
data access optimization grid computing cluster computing optimization algorithms resource allocation modeling and simulation |
description |
The data Grid, a class of Grid Computing, aims at providing services and infrastructure to data-intensive distributed applications which need to access, transfer and modify large data storages. A common issue on Data Grids is the data access optimization, which has been addressed through different approaches such as bio-inspired and replication strategies. However, few of those approaches consider application features to optimize data access operations (read-and-write). Those features define the application behavior, which supports the optimization of operations, consequently, improving the overall system performance. Motivated by the need of efficient data access in large scale distributed environments and by the affordable improvements of application characteristics, this paper proposes a new heuristic to optimize data access operations based on historical behavior of applications. Throughout experiments we concluded that applications are better optimized by anticipating different numbers of future events, which vary over the execution. Then, in order to address such issue, we proposed an adaptive sliding window which automatically and dynamically defines how many future operations must be considered to improve the overall application performance. Simulations were conducted using the OptorSim simulator, which is commonly considered in this research field. Our experimental evaluation confirms that the proposed heuristic reduces application execution times up to 50% when compared to other approaches. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-06-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/332 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/332 |
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/332/316 |
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. 10 No. 2 (2011): June, 2011; 26-43 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_ |
1799874741374287872 |