In search of a map : using program slicing to discover potential parallelism in recursive functions
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
Recursion schemes, such as the well-known map, can be used as loci of potential parallelism, where schemes are replaced with an equivalent parallel implementation. This paper formalises a novel technique, using program slicing, that automatically and statically identifies computations in recursive functions that can be lifted out of the function and then potentially performed in parallel. We define a new program slicing algorithm, build a prototype implementation, and demonstrate its use on 12 Haskell examples, including benchmarks from the NoFib suite and functions from the standard Haskell Prelude. In all cases, we obtain the expected results in terms of finding potential parallelism. Moreover, we have tested our prototype against synthetic benchmarks, and found that our prototype has quadratic time complexity. For the NoFib benchmark examples we demonstrate that relative parallel speedups can be obtained (up to 32.93x the sequential performance on 56 hyperthreaded cores).
Barwell , A D & Hammond , K 2017 , In search of a map : using program slicing to discover potential parallelism in recursive functions . in Proceedings of the 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing (FHPC 2017) . ACM , New York , pp. 30-41 , FHPC 2017 Workshop on Functional High-Performance Computing , Oxford , United Kingdom , 7/09/17 . https://doi.org/10.1145/3122948.3122951workshop
Proceedings of the 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing (FHPC 2017)
© 2017 Copyright held by the owner/author(s). Publication rights licensed to Association for Computing Machinery.. 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 as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1145/3122948.3122951
DescriptionFunding: EU FP7 grant “Parallel Patterns for Adaptive Heterogeneous Multicore Systems” (ICT-288570), by the EU H2020 grant “RePhrase: Refactoring Parallel Het- erogeneous Resource-Aware Applications – a Software Engineering Approach” (ICT-644235), by COST Action IC1202 (“Timing Analysis on Code-Level”), by the EPSRC grant “Discovery: Pattern Discovery and Program Shaping for Manycore Systems” (EP/P020631/1), and by Scottish Enterprise grant PS7305CA44.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.