Automatic Skeletons in Template Haskell

Abstract

This paper uses Template Haskell to automatically select appropriate skeleton implementations in the Eden parallel dialect of Haskell. The approach allows implementation parameters to be statically tuned according to architectural cost models based on source analyses. This permits us to target a range of parallel architecture classes from a single source specification. A major advantage of the approach is that cost models are user-definable and can be readily extended to new data or computation structures etc.

Eden – Parallel Functional Programming with Haskell

“…A sophisticated distributed workpool has been presented in [19]. Definitions and applications of further specific skeletons can be found in the following papers: topology skeletons [9], adaptive skeletons [25], divide-and-conquer schemes [5,36]. Special skeletons for computer algebra algorithms are developed with the goal to define the kernel of a computer algebra system in Eden [37,35].…”

Parallel programming and performance predictability with Orléans Skeleton Library

“…Since the idea of skeletons has close relationship with functional programming, there are several implementations based on functional languages such as Template Haskell [8], and Objective Caml [10]. Libraries based on C or C++ aim at being efficient and more widely used than the previous libraries.…”

Space profiling for parallel functional programs

“…Jay et al (1997) describe a static framework for reasoning about the costs of parallel execution using a monadic language. Static cost models have also been used to automatically choose a parallel implementation at compile-time based on hardware performance parameters (Hammond et al 2003) and to inform the granularity of scheduling (Loidl & Hammond 1996). This work complements ours in that it focuses on how the sizes of program data structures affect parallel execution (e.g., through communication costs), rather than how different parallel schedules affect the use of space at a given point in time.…”