Data Parallel Skeletons in Java

Parallel Dynamic Programming using Data - Parallel Skeletons ∗

For demonstrating the powerfulness of skeletal programming we have developed a parallelization technique toward one class of optimization problems called maximum marking problems, which can be recognized as one class of dynamic programming. This paper, as in the course of an ongoing research, focuses on problems of dynamic programming in general, and examines how the skeletal approach successfu...

Auto-Tuning Parallel Skeletons

Parallel skeletons are a structured parallel programming abstraction that provide programmers with a predefined set of algorithmic templates that can be combined, nested and parameterized with sequential code to produce complex programs. The implementation of these skeletons is currently a manual process, requiring human expertise to choose suitable implementation parameters that provide good p...

Automatically Optimising Parallel Skeletons

Parallel skeletons are a structured approach to parallel programming that provide programmers with a predefined set of algorithmic templates that can be combined, nested and parametrised with sequential code to produce complex programs. The implementation of these skeletons is currently a manual process, requiring human expertise to choose suitable implementation parameters that provide good pe...

HPJava: Data Parallel Extensions to Java

Annotating Spar / Java for data - parallel programming