Program Transformation to Identify List-Based Parallel Skeletons

Venkatesh Kannan
(School of Computing, Dublin City University, Ireland)
G. W. Hamilton
(School of Computing, Dublin City University, Ireland)

Algorithmic skeletons are used as building-blocks to ease the task of parallel programming by abstracting the details of parallel implementation from the developer. Most existing libraries provide implementations of skeletons that are defined over flat data types such as lists or arrays. However, skeleton-based parallel programming is still very challenging as it requires intricate analysis of the underlying algorithm and often uses inefficient intermediate data structures. Further, the algorithmic structure of a given program may not match those of list-based skeletons. In this paper, we present a method to automatically transform any given program to one that is defined over a list and is more likely to contain instances of list-based skeletons. This facilitates the parallel execution of a transformed program using existing implementations of list-based parallel skeletons. Further, by using an existing transformation called distillation in conjunction with our method, we produce transformed programs that contain fewer inefficient intermediate data structures.

In Geoff Hamilton, Alexei Lisitsa and Andrei P. Nemytykh: Proceedings of the Fourth International Workshop on Verification and Program Transformation (VPT 2016), Eindhoven, The Netherlands, 2nd April 2016, Electronic Proceedings in Theoretical Computer Science 216, pp. 118–136.
Published: 6th July 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.216.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org