Abstract
Commodity processors are comprised of several CPU cores and one integrated GPU. To fully exploit this type of architectures, one needs to automatically determine how to partition the workload between both devices. This is specially challenging for irregular workloads, where each iteration's work is data dependent and shows control and memory divergence. In this paper, we present a novel adaptive partitioning strategy specially designed for irregular applications running on heterogeneous CPU-GPU chips. The main novelty of this work is that the size of the workload assigned to the GPU and CPU adapts dynamically to maximize the GPU and CPU utilization while balancing the workload among the devices. Our experimental results on an Intel Haswell architecture using a set of irregular benchmarks show that our approach outperforms exhaustive static and adaptive state-of-the-art approaches in terms of performance and energy consumption.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 140-149 |
| Number of pages | 10 |
| Journal | Procedia Computer Science |
| Volume | 51 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2015 |
| Event | International Conference on Computational Science, ICCS 2002 - Amsterdam, Netherlands Duration: Apr 21 2002 → Apr 24 2002 |
Keywords
- Adaptive partitioning
- Dynamic scheduling
- Heterogeneous CPU-GPU chips
- Parallel for
ASJC Scopus subject areas
- General Computer Science