Boosting irregular array Reductions through In-lined Block-ordering on fast processors

Array-type reductions represent a frequently occurring algorithmic pattern in many scientific applications. A special case occurs if array elements are accessed in an irregular, often random manner, making their concurrent and scalable execution difficult. In this work we present a new approach that...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 IEEE High Performance Extreme Computing Conference (HPEC) s. 1 - 6
Hlavní autoři: Ciesko, Jan, Mateo, Sergi, Teruel, Xavier, Beltran, Vicenc, Martorell, Xavier, Labarta, Jesus
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2015
Témata:
Array reduction
Arrays
Bandwidth
Instruction sets
OpenMP
PIBOR
Privatization
Resource management
Runtime
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Array-type reductions represent a frequently occurring algorithmic pattern in many scientific applications. A special case occurs if array elements are accessed in an irregular, often random manner, making their concurrent and scalable execution difficult. In this work we present a new approach that consists of language and runtime support and targets popular parallel programming models such as OpenMP. Its runtime support implements Privatization with In-lined, Block-Ordered Reductions (PIBOR), a new approach that trades processor cycles to increase locality and bandwidth efficiency for such algorithms. A reference implementation in OmpSs, a task-parallel programming model, shows promising results on current multicore systems.
DOI:10.1109/HPEC.2015.7322443