Intel Concurrent Collections for Haskell
Name
MIT-CSAIL-TR-2011-015.pdf
Size
281.33 KB
Format
Adobe PDF
Checksum (MD5)
a1f230ac0177091243f0cf59cb8b56e7
Author(s)
Newton, Ryan
Chen, Chih-Ping
Marlow, Simon
Advisor(s)
Arvind
Date Issued
March 22, 2011
Series/Report no.
MIT-CSAIL-TR-2011-015
Abstract
Intel Concurrent Collections (CnC) is a parallel programming model in which a network of steps (functions) communicate through message-passing as well as a limited form of shared memory. This paper describes a new implementation of CnC for Haskell. Compared to existing parallel programming models for Haskell, CnC occupies a useful point in the design space: pure and deterministic like Evaluation Strategies, but more explicit about granularity and the structure of the parallel computation, which affords the programmer greater control over parallel performance. We present results on 4, 8, and 32-core machines demonstrating parallel speedups over 20x on non-trivial benchmarks.
Subjects
dataflow computation
task graphs
I-structures
Terms of Use
Creative Commons Attribution 3.0 Unported
Persistent DSpace Link
