SCHEDULE: NOV 16-22, 2013
When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.
A Large-Scale Cross-Architecture Evaluation of Thread-Coarsening
SESSION: GPU Programming
EVENT TYPE: Papers
TIME: 11:00AM - 11:30AM
SESSION CHAIR: Michael Garland
AUTHOR(S):Alberto Magni, Christophe Dubach, Michael F.P. O'Boyle
ROOM:205/207
ABSTRACT:
OpenCL has become the de facto data parallel programming model for parallel devices in todays high-performance supercomputers. OpenCL was designed with the goal of guaranteeing program portability across hardware from different vendors. However, achieving good performance is hard, requiring manual tuning of the program and expert knowledge of each target device.
In this paper we consider a data parallel compiler transformation thread-coarsening and evaluate its effects across a range of devices by developing a source-to-source OpenCL compiler based on LLVM. We thoroughly evaluate this transformation on 17 benchmarks and five platforms with different coarsening parameters giving over 43,000 different experiments.
We achieve speedups over 9x on individual applications and average speedups ranging from 1.15x on the NVIDIA Kepler GPU to 1.50x on the AMD Cypress GPU. Finally, we use statistical regression to analyze and explain program performance in terms of hardware-based performance counters.
Chair/Author Details:
Michael Garland (Chair) - NVIDIA
Alberto Magni - University of Edinburgh
Christophe Dubach - University of Edinburgh
Michael F.P. O'Boyle - University of Edinburgh
Click here to download .ics calendar file
Click here to download .vcs calendar file
Click here to add event to your Google Calendar
The full paper can be found in the ACM Digital Library