Name
Title | ||
|---|---|---|
Coordinated CTA Combination and Bandwidth Partitioning for GPU Concurrent Kernel Execution |
Abstract | ||
|---|---|---|
Contemporary GPUs support multiple kernels to run concurrently on the same streaming multiprocessors (SMs). Recent studies have demonstrated that such concurrent kernel execution (CKE) improves both resource utilization and computational throughput. Most of the prior works focus on partitioning the GPU resources at the cooperative thread array (CTA) level or the warp scheduler level to improve CKE. However, significant performance slowdown and unfairness are observed when latency-sensitive kernels co-run with bandwidth-intensive ones. The reason is that bandwidth over-subscription from bandwidth-intensive kernels leads to much aggravated memory access latency, which is highly detrimental to latency-sensitive kernels. Even among bandwidth-intensive kernels, more intensive kernels may unfairly consume much higher bandwidth than less-intensive ones.
In this article, we first make a case that such problems cannot be sufficiently solved by managing CTA combinations alone and reveal the fundamental reasons. Then, we propose a coordinated approach for CTA combination and bandwidth partitioning. Our approach dynamically detects co-running kernels as latency sensitive or bandwidth intensive. As both the DRAM bandwidth and L2-to-L1 Network-on-Chip (NoC) bandwidth can be the critical resource, our approach partitions both bandwidth resources coordinately along with selecting proper CTA combinations. The key objective is to allocate more CTA resources for latency-sensitive kernels and more NoC/DRAM bandwidth resources to NoC-/DRAM-intensive kernels. We achieve it using a variation of dominant resource fairness (DRF). Compared with two state-of-the-art CKE optimization schemes, SMK [52] and WS [55], our approach improves the average harmonic speedup by 78% and 39%, respectively. Even compared to the best possible CTA combinations, which are obtained from an exhaustive search among all possible CTA combinations, our approach improves the harmonic speedup by up to 51% and 11% on average.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3326124 | ACM Transactions on Architecture and Code Optimization (TACO) |
Keywords | Field | DocType |
GPGPU, TLP, bandwidth management, concurrent kernel execution | Kernel (linear algebra),Computer science,Parallel computing,Bandwidth (signal processing) | Journal |
Volume | Issue | ISSN |
16 | 3 | 1544-3566 |
Citations | PageRank | References |
1 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen Lin | 1 | 35 | 4.21 |
| Hongwen Dai | 2 | 28 | 3.14 |
| Michael Mantor | 3 | 10 | 1.16 |
| Huiyang Zhou | 4 | 994 | 63.26 |