Farms, pipes, streams and reforestation : reasoning about structured parallel processes using types and hylomorphisms
MetadataShow full item record
The increasing importance of parallelism has motivated the creation of better abstractions for writing parallel software, including structured parallelism using nested algorithmic skeletons. Such approaches provide high-level abstractions that avoid common problems, such as race conditions, and often allow strong cost models to be defined. However, choosing a combination of algorithmic skeletons that yields good parallel speedups for a program on some specific parallel architecture remains a difficult task. In order to achieve this, it is necessary to simultaneously reason both about the costs of different parallel structures and about the semantic equivalences between them. This paper presents a new type-based mechanism that enables strong static reasoning about these properties. We exploit well-known properties of a very general recursion pattern, hylomorphisms, and give a denotational semantics for structured parallel processes in terms of these hylomorphisms. Using our approach, it is possible to determine formally whether it is possible to introduce a desired parallel structure into a program without altering its functional behaviour, and also to choose a version of that parallel structure that minimises some given cost model.
Castro , D , Hammond , K & Sarkar , S 2016 , Farms, pipes, streams and reforestation : reasoning about structured parallel processes using types and hylomorphisms . in Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming . ACM , New York , pp. 4-17 , ICFP 2016 - 21st ACM SIGPLAN International Conference on Functional Programming , Nara , Japan , 18/09/16 . DOI: 10.1145/2951913.2951920conference
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming
© 2016, the Author(s). This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at dl.acm.org / https://doi.org/10.1145/2951913.2951920
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.