ZUNINO SUAREZ Alejandro Octavio
EasyFJP: Providing Hybrid Parallelism as a Concern for Divide and Conquer Java Applications (Indexed SCI, IF JCR2013=0.575)
MATEOS, C.; ZUNINO, A.; HIRSCH, M.
COMPUTER SCIENCE AND INFORMATION SYSTEMS
Año: 2013 vol. 10 p. 1129 - 1163
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.