Lazy tree splitting

@inproceedings{Bergstrom2010LazyTS,
  title={Lazy tree splitting},
  author={Lars Bergstrom and Mike Rainey and John H. Reppy and Adam Shaw and Matthew Fluet},
  booktitle={ICFP},
  year={2010}
}
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient compilation of NDP programs, and various common NDP operations like parallel maps, filters, and sum-like reductions. In this paper, we describe the implementation of NDP in Parallel ML (PML), part of the Manticore project. Managing the parallel decomposition of work is one of the main challenges of implementing NDP. If… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

Partial Flattening: A Compilation Technique for Irregular Nested Parallelism on GPGPUs

2016 45th International Conference on Parallel Processing (ICPP) • 2016
View 2 Excerpts

Program Transformation to Identify Parallel Skeletons

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) • 2016
View 1 Excerpt

Similar Papers

Loading similar papers…