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...

Full description

Saved in:
Bibliographic Details
Published in:2015 IEEE High Performance Extreme Computing Conference (HPEC) pp. 1 - 6
Main Authors: Ciesko, Jan, Mateo, Sergi, Teruel, Xavier, Beltran, Vicenc, Martorell, Xavier, Labarta, Jesus
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2015
Subjects:
Array reduction
Arrays
Bandwidth
Instruction sets
OpenMP
PIBOR
Privatization
Resource management
Runtime
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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