OpenCL task partitioning in the presence of GPU contention

Grewe, Dominik and Wang, Zheng and O'Boyle, Michael (2014) OpenCL task partitioning in the presence of GPU contention. In: Languages and compilers for parallel computing. Lecture Notes in Computer Science . Springer, pp. 87-101. ISBN 9783319099668

Full text not available from this repository.


Heterogeneous multi- and many-core systems are increasingly prevalent in the desktop and mobile domains. On these systems it is common for programs to compete with co-running programs for resources. While multi-task scheduling for CPUs is a well-studied area, how to partitioning and map computing tasks onto the heterogeneous system in the presence of GPU contention (i.e. multiple programs compete for the GPU) remains an outstanding problem. In this paper we consider the problem of partitioning OpenCL kernels on a CPU-GPU based system in the presence of contention on the GPU. We propose a machine learning-based approach that predicts the optimal partitioning of OpenCL kernels, explicitly taking GPU contention into account. Our predictive model achieves a speed-up of 1.92 over a scheme that always uses the GPU. When compared to two state-of-the-art dynamic approaches our model achieves speed-ups of 1.54 and 2.56 respectively.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
Deposited By:
Deposited On:
05 Aug 2014 10:08
Last Modified:
20 Sep 2023 02:19