Higher Order Flattening
We extend the flattening transformation, which turns nested into flat data parallelism, to the full higher-order case, including lambda abstractions and data parallel arrays of functions. Our central observation is that flattening needs to transform the closures used to represent functional values. Thus, we use closure conversion before flattening and introduce array closures to represent arrays of functional values.
Unable to display preview. Download preview PDF.
- 1.Blelloch, G.E.: Vector Models for Data-Parallel Computing. MIT Press, Cambridge (1990)Google Scholar
- 2.Blelloch, G.E.: Programming parallel algorithms. CACM 39(3), 85–97 (1996)Google Scholar
- 6.Leshchinskiy, R.: Higher-Order Nested Data Parallelism: Semantics and Implementation. PhD thesis, Technische Universität Berlin (2005)Google Scholar