Manycore accelerators have recently proven a promising solution for increasingly powerful and energy efficient computing systems. This raises the need for parallel programming models capable of effectively leveraging hundreds to thousands of processors. Task-based parallelism has the potential to provide such capabilities, offering flexible support to fine-grained and irregular parallelism. However, efficiently supporting this programming paradigm on resource-constrained parallel accelerators is a challenging task. In this paper, we present an optimized implementation of the OpenMP tasking model for embedded parallel accelerators, discussing the key design solution that guarantee small memory (footprint) and minimize performance overheads. We validate our design by comparing to several state-of-the-art tasking implementations, using the most representative parallelization patterns. The experimental results confirm that our solution achieves near-ideal speedups for tasks as small as 5K cycles.
|Data di pubblicazione:||2016|
|Titolo:||An optimized task-based runtime system for resource-constrained parallel accelerators|
|Autore/i:||Cesarini, D; Marongiu, A; Benini, L|
|Nome del convegno:||19th Design, Automation and Test in Europe Conference and Exhibition, DATE 2016|
|Luogo del convegno:||Dresden|
|Data del convegno:||14-18 March 2016|
|Citazione:||An optimized task-based runtime system for resource-constrained parallel accelerators / Cesarini, D; Marongiu, A; Benini, L. - ELETTRONICO. - (2016), pp. 1261-1266. ((Intervento presentato al convegno 19th Design, Automation and Test in Europe Conference and Exhibition, DATE 2016 tenutosi a Dresden nel 14-18 March 2016.|
|Tipologia||Relazione in Atti di Convegno|
File in questo prodotto:
I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris