10566

A streaming model for nested data parallelism

Frederik M. Madsen
Faculty of Science, University of Copenhagen
University of Copenhagen, 2013
@article{madsen2013streaming,

   title={A streaming model for nested data parallelism},

   author={Madsen, Frederik M},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

895

views

Efficient parallel algorithms are often written with embedded knowledge of the back-end that they are meant to be executed on, and if they are not, the translation to target language often produces inefficient code. A concrete problem is space complexity in nested data parallel (NDP) languages such as NESL and Data Parallel Haskell, where large intermediate arrays are often allocated during execution. This thesis presents an NDP language with a streaming based model where the time complexity of programs is just as good as in traditional NDP languages, but the space complexity is significantly better in many cases. A minimal NDP language with semantics and a desirable cost model is defined, as well as a streaming based target language, and the two languages are related with a translation, a proof-of-concept implementation and a conjecture about value and cost preservation.
VN:F [1.9.22_1171]
Rating: 5.0/5 (1 vote cast)
A streaming model for nested data parallelism, 5.0 out of 5 based on 1 rating

* * *

* * *

Follow us on Twitter

HGPU group

1943 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

442 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: