| dc.contributor | Arvind | en_US |
| dc.contributor | Computation Structures | en_US |
| dc.date.accessioned | 2011-03-22T17:00:16Z | |
| dc.date.accessioned | 2018-11-26T22:26:34Z | |
| dc.date.available | 2011-03-22T17:00:16Z | |
| dc.date.available | 2018-11-26T22:26:34Z | |
| dc.date.issued | 2011-03-22 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/61759 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/61759 | |
| dc.description.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. | en_US |
| dc.format.extent | 21 p. | en_US |
| dc.rights | Creative Commons Attribution 3.0 Unported | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/3.0/ | |
| dc.subject | dataflow computation | en_US |
| dc.subject | task graphs | en_US |
| dc.subject | I-structures | en_US |
| dc.title | Intel Concurrent Collections for Haskell | en_US |
