Scaling irregular array-type reductions in OmpSs

Document typeConference report
Defense date2015-05-05
PublisherBarcelona Supercomputing Center
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
Array-type reductions represent a frequently occurring
algorithmic pattern in many scientific applications. A special case
occurs if array elements are accessed in a non-linear, often random
manner, which makes their concurrent and scalable execution
difficult. In this work we present a new approach that consists of
language- and runtime support to facilitate programming and
delivers high scalability on modern shared-memory systems for such
irregular array-type reductions. A reference implementation in
OmpSs, a task-parallel programming model, shows promising results
with speed-ups up to 15x on the Intel Xeon processor.
CitationCiesko, Jan [et al.]. Scaling irregular array-type reductions in OmpSs. A: "BSC Doctoral Symposium (2nd: 2015: Barcelona)". 2nd ed. Barcelona: Barcelona Supercomputing Center, 2015, p. 138-140.
Files | Description | Size | Format | View |
---|---|---|---|---|
scaling_irregular_DS2105-BoAv11-12.pdf | 174,6Kb | View/Open |