Abstract
Graphics processing units (GPUs) have become one of the best platforms for exploiting the plentiful thread-level parallelism of applications. However, GPUs continue to underutilize their hardware resources for optimizing the performance of numerous general-purpose applications. One primary reason for this is the inefficiency of existing warp schedulers in hiding long-latency operations such as global loads and stores. This study proposes a long-latency operation-based warp scheduler to improve GPU performance. In the proposed warp scheduler, warps are partitioned into different pools based on the characteristics of instructions that are subsequently executed. Specifically, this warp scheduler uses warps that are likely waiting for long-latency operations for a guiding role. Meanwhile, other warps perform filling roles (i.e., to overlap the latencies caused by the guiding warps). Our experimental results demonstrate that the proposed warp scheduler improves GPU performance by 24.4% on average as compared to the conventional warp scheduler.
Original language | English |
---|---|
Pages (from-to) | 3043-3062 |
Number of pages | 20 |
Journal | Journal of Supercomputing |
Volume | 76 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2020 Apr 1 |
Bibliographical note
Publisher Copyright:© 2019, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- GPGPU
- Memory latency
- Performance
- Utilization
- Warp scheduling
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
- Information Systems
- Hardware and Architecture