This paper describes a new technique for identifying potentially parallelisable code structures in functional programs. Higher-order functions enable simple and easily …
The ParaPhrase Refactoring Tool for Erlang PaRTE provides automatic, comprehensive and reliable pattern candidate discovery to locate parallelisable components in Erlang programs …
Background Recent work has studied diverse affecting factors on software energy efficiency. Objective This paper attempts to shed light on the energy behavior of programs written in a …
A Galizia, D D'Agostino, A Clematis - Journal of Computational and …, 2015 - Elsevier
Scientific image processing is a topic of interest for a broad scientific community since it is a mean of gaining understanding and insight into the data for a growing number of …
Refactoring is the process of changing the structure of a program without changing its behaviour. Refactoring has so far only really been deployed effectively for sequential …
This paper proposes a new high-level approach for optimising field programmable gate array (FPGA) designs. FPGA designs are commonly implemented in low-level hardware …
Modern multicore systems offer huge computing potential. Exploiting large parallel systems is still a very challenging task, however, especially as many software developers still use …
We propose program analyses to identify parallelizable code fragments, and program transformations to change those fragments into applications of high-level parallel patterns …
Divide-and-conquer algorithms appear in the solution of many computationally intensive problems, and are good candidates for parallelization. A divide-and-conquer computation …