A "minimal disruption" skeleton experiment: seamless map & reduce embedding in OCaml

被引：18

作者：

Danelutto, M. ^{[1
]}

Di Cosmo, R. ^{[2
]}

机构：

[1] Univ Pisa, Dept Comp Sci, Largo B Pontecorvo 3, I-56127 Pisa, Italy

[2] Univ Paris Diderot, Sorbonne Paris Cite, INRIA Paris Rocquencourt, CNRS,PPS,UMR 7126, F-75205 Paris, France

来源：

PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2012 | 2012年 / 9卷

关键词：

structured parallel programming; algorithmic skeletons; map; reduce; PARALLEL;

D O I：

10.1016/j.procs.2012.04.202

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We discuss the implementation of a minimalist parallel library in OCaml. The library provides parallel map and fold (reduce) higher order functions and targets standard cache coherent shared memory multi-cores. Our Parmap. parmap and Parmap. parfold functions may be used to seamlessly replace OCaml List map and fold standard functions preserving their full functional semantics while achieving nearly optimal speedup on standard multi-core architectures. We discuss the design of the Parmap module, the main implementation features and we present some experimental results assessing the efficiency of the Parmap parallel functions. Overall, Parmap represents a perfect incarnation of the "propagate the concept with minimal disruption" principle introduced in Cole's algorithmic skeleton manifesto.

引用

页码：1837 / 1846

页数：10