We present a complete redesign of evaluation strategies, a key abstraction for specifying pure, deterministic parallelism in Haskell. Our new formulation preserves the compositionality and modularity benefits of the original, while providing significant new benefits. First, we introduce an evaluation-order monad to provide clearer, more generic, and more efficient specification of parallel evaluation. Secondly, the new formulation resolves a subtle space management issue with the original strategies, allowing parallelism (sparks) to be preserved while reclaiming heap associated with superfluous parallelism. Related to this, the new formulation provides far better support for speculative parallelism as the garbage collector now prunes unneeded speculation. Finally, the new formulation provides improved compositionality: we can directly express parallelism embedded within lazy data structures, producing more compositional strategies, and our basic strategies are parametric in the coordination combinator, facilitating a richer set of parallelism combinators.
We give measurements over a range of benchmarks demonstrating that the runtime overheads of the new formulation relative to the original are low, and the new strategies even yield slightly better speedups on average than the original strategies.
|Title of host publication||Haskell'10 - Proceedings of the 2010 ACM SIGPLAN Haskell Symposium, Co-located with ICFP'10|
|Publisher||Association for Computing Machinery|
|Number of pages||12|
|Publication status||Published - Sep 2010|
|Event||2010 ACM SIGPLAN Haskell Symposium - Baltimore, MD, United States|
Duration: 30 Sep 2010 → 30 Sep 2010
|Conference||2010 ACM SIGPLAN Haskell Symposium|
|Period||30/09/10 → 30/09/10|
- parallel functional programming