9033

Selection of Task Implementations in the Nanos++ Runtime

Judit Planas, Rosa M. Badia, Eduard Ayguade, Jesus Labarta
Barcelona Supercomputing Center, Barcelona, Spain
PRACE WP53, 2013

@article{planas2013selection,

   title={Selection of Task Implementations in the Nanos++ Runtime},

   author={Planas, Judit and Badia, Rosa M and Ayguad{‘e}, Eduard and Labarta, Jes{‘u}s},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

693

views

New heterogeneous systems and hardware accelerators can give higher levels of computational power to high performance computers. However, this does not come for free, since the more heterogeneity the system presents, the more complex becomes the programming task in terms of resource utilization. OmpSs is a task-based programming model and framework focused on the automatic parallelization of sequential applications. We present a set of extensions to this framework: we show how the application programmer can expose different specialized versions of tasks (i.e. pieces of specific code targeted and optimized for a particular architecture) and how the framework will choose between these versions at runtime to obtain the best performance achievable for the given application. From our results, obtained in a multi-GPU system, we can prove that our project gives flexibility to application’s source code and can potentially increase application’s performance.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: