EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications
- Autores
- Mateos Diaz, Cristian Maximiliano; Zunino Suarez, Alejandro Octavio; Hirsch Jofré, Matías Eberardo
- Año de publicación
- 2013
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- Because of the increasing availability of multi-core machines, clus- ters, Grids, and combinations of these there is now plenty of computational power,but today's programmers are not fully prepared to exploit parallelism. In particular, Java has helped in handling the heterogeneity of such environments. However, there is a lot of ground to cover regarding facilities to easily and elegantly parallelizing applications. One path to this end seems to be the synthesis of semi- automatic parallelism and Parallelism as a Concern (PaaC). The former allows users to be mostly unaware of parallel exploitation problems and at the same time manually optimize parallelized applications whenever necessary, while the latter allows applications to be separated from parallel-related code. In this paper, we present EasyFJP, an approach that implicitly exploits parallelism in Java applications based on the concept of fork-join synchronization pattern, a simple but effective abstraction for creating and coordinating parallel tasks. In addition, EasyFJP lets users to explicitly optimize applications through policies, or user-provided rules to dynamically regulate task granularity. Finally, EasyFJP relies on PaaC by means of source code generation techniques to wire applications and parallel-specific code together. Experiments with real-world applications on an emulated Grid and a cluster evidence that EasyFJP delivers competitive performance compared to state-of-the-art Java parallel programming tools.
Fil: Mateos Diaz, Cristian Maximiliano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina;
Fil: Zunino Suarez, Alejandro Octavio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina;
Fil: Hirsch Jofré, Matías Eberardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina; - Materia
-
PARALLEL COMPUTING
IMPLICIT PARALLELISM
EXPLICIT PARALLELISM
PARALLELISM AS A CONCERN (PAAC)
JAVA
FORK-JOIN SYNCHRONIZATION PATTERNS
POLICIES - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/1119
Ver los metadatos del registro completo
id |
CONICETDig_6c8de66cd85aa1696e997d56e52aeece |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/1119 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java ApplicationsMateos Diaz, Cristian MaximilianoZunino Suarez, Alejandro OctavioHirsch Jofré, Matías EberardoPARALLEL COMPUTINGIMPLICIT PARALLELISMEXPLICIT PARALLELISMPARALLELISM AS A CONCERN (PAAC)JAVAFORK-JOIN SYNCHRONIZATION PATTERNSPOLICIEShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Because of the increasing availability of multi-core machines, clus- ters, Grids, and combinations of these there is now plenty of computational power,but today's programmers are not fully prepared to exploit parallelism. In particular, Java has helped in handling the heterogeneity of such environments. However, there is a lot of ground to cover regarding facilities to easily and elegantly parallelizing applications. One path to this end seems to be the synthesis of semi- automatic parallelism and Parallelism as a Concern (PaaC). The former allows users to be mostly unaware of parallel exploitation problems and at the same time manually optimize parallelized applications whenever necessary, while the latter allows applications to be separated from parallel-related code. In this paper, we present EasyFJP, an approach that implicitly exploits parallelism in Java applications based on the concept of fork-join synchronization pattern, a simple but effective abstraction for creating and coordinating parallel tasks. In addition, EasyFJP lets users to explicitly optimize applications through policies, or user-provided rules to dynamically regulate task granularity. Finally, EasyFJP relies on PaaC by means of source code generation techniques to wire applications and parallel-specific code together. Experiments with real-world applications on an emulated Grid and a cluster evidence that EasyFJP delivers competitive performance compared to state-of-the-art Java parallel programming tools.Fil: Mateos Diaz, Cristian Maximiliano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina;Fil: Zunino Suarez, Alejandro Octavio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina;Fil: Hirsch Jofré, Matías Eberardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina;Comsis Consortium2013-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/1119Mateos Diaz, Cristian Maximiliano; Zunino Suarez, Alejandro Octavio; Hirsch Jofré, Matías Eberardo; EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications; Comsis Consortium; Computer Science And Information Systems; 10; 3; 6-2013; 1129-11631820-0214enginfo:eu-repo/semantics/altIdentifier/url/www.comsis.orginfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:45:44Zoai:ri.conicet.gov.ar:11336/1119instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:45:44.486CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications |
title |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications |
spellingShingle |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications Mateos Diaz, Cristian Maximiliano PARALLEL COMPUTING IMPLICIT PARALLELISM EXPLICIT PARALLELISM PARALLELISM AS A CONCERN (PAAC) JAVA FORK-JOIN SYNCHRONIZATION PATTERNS POLICIES |
title_short |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications |
title_full |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications |
title_fullStr |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications |
title_full_unstemmed |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications |
title_sort |
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications |
dc.creator.none.fl_str_mv |
Mateos Diaz, Cristian Maximiliano Zunino Suarez, Alejandro Octavio Hirsch Jofré, Matías Eberardo |
author |
Mateos Diaz, Cristian Maximiliano |
author_facet |
Mateos Diaz, Cristian Maximiliano Zunino Suarez, Alejandro Octavio Hirsch Jofré, Matías Eberardo |
author_role |
author |
author2 |
Zunino Suarez, Alejandro Octavio Hirsch Jofré, Matías Eberardo |
author2_role |
author author |
dc.subject.none.fl_str_mv |
PARALLEL COMPUTING IMPLICIT PARALLELISM EXPLICIT PARALLELISM PARALLELISM AS A CONCERN (PAAC) JAVA FORK-JOIN SYNCHRONIZATION PATTERNS POLICIES |
topic |
PARALLEL COMPUTING IMPLICIT PARALLELISM EXPLICIT PARALLELISM PARALLELISM AS A CONCERN (PAAC) JAVA FORK-JOIN SYNCHRONIZATION PATTERNS POLICIES |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
Because of the increasing availability of multi-core machines, clus- ters, Grids, and combinations of these there is now plenty of computational power,but today's programmers are not fully prepared to exploit parallelism. In particular, Java has helped in handling the heterogeneity of such environments. However, there is a lot of ground to cover regarding facilities to easily and elegantly parallelizing applications. One path to this end seems to be the synthesis of semi- automatic parallelism and Parallelism as a Concern (PaaC). The former allows users to be mostly unaware of parallel exploitation problems and at the same time manually optimize parallelized applications whenever necessary, while the latter allows applications to be separated from parallel-related code. In this paper, we present EasyFJP, an approach that implicitly exploits parallelism in Java applications based on the concept of fork-join synchronization pattern, a simple but effective abstraction for creating and coordinating parallel tasks. In addition, EasyFJP lets users to explicitly optimize applications through policies, or user-provided rules to dynamically regulate task granularity. Finally, EasyFJP relies on PaaC by means of source code generation techniques to wire applications and parallel-specific code together. Experiments with real-world applications on an emulated Grid and a cluster evidence that EasyFJP delivers competitive performance compared to state-of-the-art Java parallel programming tools. Fil: Mateos Diaz, Cristian Maximiliano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina; Fil: Zunino Suarez, Alejandro Octavio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina; Fil: Hirsch Jofré, Matías Eberardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico - CONICET - Tandil. Instituto Superior de Ingenieria del Software; Argentina; |
description |
Because of the increasing availability of multi-core machines, clus- ters, Grids, and combinations of these there is now plenty of computational power,but today's programmers are not fully prepared to exploit parallelism. In particular, Java has helped in handling the heterogeneity of such environments. However, there is a lot of ground to cover regarding facilities to easily and elegantly parallelizing applications. One path to this end seems to be the synthesis of semi- automatic parallelism and Parallelism as a Concern (PaaC). The former allows users to be mostly unaware of parallel exploitation problems and at the same time manually optimize parallelized applications whenever necessary, while the latter allows applications to be separated from parallel-related code. In this paper, we present EasyFJP, an approach that implicitly exploits parallelism in Java applications based on the concept of fork-join synchronization pattern, a simple but effective abstraction for creating and coordinating parallel tasks. In addition, EasyFJP lets users to explicitly optimize applications through policies, or user-provided rules to dynamically regulate task granularity. Finally, EasyFJP relies on PaaC by means of source code generation techniques to wire applications and parallel-specific code together. Experiments with real-world applications on an emulated Grid and a cluster evidence that EasyFJP delivers competitive performance compared to state-of-the-art Java parallel programming tools. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-06 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/1119 Mateos Diaz, Cristian Maximiliano; Zunino Suarez, Alejandro Octavio; Hirsch Jofré, Matías Eberardo; EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications; Comsis Consortium; Computer Science And Information Systems; 10; 3; 6-2013; 1129-1163 1820-0214 |
url |
http://hdl.handle.net/11336/1119 |
identifier_str_mv |
Mateos Diaz, Cristian Maximiliano; Zunino Suarez, Alejandro Octavio; Hirsch Jofré, Matías Eberardo; EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications; Comsis Consortium; Computer Science And Information Systems; 10; 3; 6-2013; 1129-1163 1820-0214 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/www.comsis.org |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Comsis Consortium |
publisher.none.fl_str_mv |
Comsis Consortium |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844613431208968192 |
score |
13.070432 |