Geodesic
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications
Computer Science and Information Systems, Tome 10 (2013) no. 3.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

Because of the increasing availability of multi-core machines, clusters, 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.
Keywords: Parallel computing, implicit parallelism, explicit parallelism, Parallelism as a Concern (PaaC), Java, fork-join synchronization patterns, policies. 
@article{CSIS_2013_10_3_a10,
     author = {Cristian Mateos and Alejandro Zunino and Mat{\i}as Hirsch},
     title = {EasyFJP: {Providing} {Hybrid} {Parallelism} as a {Concern} for {Divide} and {Conquer} {Java} {Applications}},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {10},
     number = {3},
     year = {2013},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2013_10_3_a10/}
}
TY  - JOUR
AU  - Cristian Mateos
AU  - Alejandro Zunino
AU  - Matıas Hirsch
TI  - EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications
JO  - Computer Science and Information Systems
PY  - 2013
VL  - 10
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2013_10_3_a10/
ID  - CSIS_2013_10_3_a10
ER  - 
%0 Journal Article
%A Cristian Mateos
%A Alejandro Zunino
%A Matıas Hirsch
%T EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications
%J Computer Science and Information Systems
%D 2013
%V 10
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2013_10_3_a10/
%F CSIS_2013_10_3_a10
Cristian Mateos; Alejandro Zunino; Matıas Hirsch. EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications. Computer Science and Information Systems, Tome 10 (2013) no. 3. http://geodesic.mathdoc.fr/item/CSIS_2013_10_3_a10/