Argonne National Laboratory

Automatic Command Queue Scheduling for Task-Parallel Workloads in OpenCL

TitleAutomatic Command Queue Scheduling for Task-Parallel Workloads in OpenCL
Publication TypeConference Paper
Year of Publication2015
AuthorsAji, AM, Pena, AJ, Balaji, P, Feng, W
Conference NameIEEE International Conference on Cluster Computing
Date Published09/2015
Conference LocationChicago, IL
Other NumbersANL/MCS-P5220-1014
AbstractOpenCL is a portable interface that can be used to program cluster nodes with heterogeneous compute devices. The OpenCL specification tightly binds its workflow abstraction, or “command queue,” to a specific device for the entire program. For best performance, the user has to find the ideal queue–device mapping at command queue creation time, an effort that requires a thorough understanding of the match between the characteristics of all the underlying device architectures and the kernels in the program. In this paper, we propose to add scheduling attributes to the OpenCL context and command queue objects that can be leveraged by an intelligent runtime scheduler to automatically perform ideal queue–device mapping. Our proposed extensions enable the average OpenCL programmer to focus on the al- gorithm design rather than scheduling and automatically gain performance without sacrificing programmability. As an example, we design and implement an OpenCL runtime for task-parallel workloads, called MultiCL, which efficiently schedules command queues across devices. Within MultiCL, we implement several key optimizations to reduce runtime overhead. Our case studies include the SNU-NPB OpenCL benchmark suite and a real-world seismology simulation. We show that, on average, users have to apply our proposed scheduler extensions to only four source lines of code in existing OpenCL applications in order to automatically benefit from our runtime optimizations. We also show that MultiCL always maps command queues to the optimal device set with negligible runtime overhead.