CWLP:coordinatedwarp scheduling and locality-protected cache allocation onGPUs

Yang ZHANG, Zuo-cheng XING, Cang LIU, Chuan TANG

PDF(757 KB)
PDF(757 KB)
Front. Inform. Technol. Electron. Eng ›› 2018, Vol. 19 ›› Issue (2) : 206-220. DOI: 10.1631/FITEE.1700059
Article
Article

CWLP:coordinatedwarp scheduling and locality-protected cache allocation onGPUs

Author information +
History +

Abstract

As we approach the exascale era in supercomputing, designing a balanced computer system with a powerful computing ability and low power requirements has becoming increasingly important. The graphics processing unit (GPU) is an accelerator used widely in most of recent supercomputers. It adopts a large number of threads to hide a long latency with a high energy efficiency. In contrast to their powerful computing ability, GPUs have only a few megabytes of fast on-chip memory storage per streaming multiprocessor (SM). The GPU cache is inefficient due to a mismatch between the throughput-oriented execution model and cache hierarchy design. At the same time, current GPUs fail to handle burst-mode long-access latency due to GPU’s poor warp scheduling method. Thus, benefits of GPU’s high computing ability are reduced dramatically by the poor cache management and warp scheduling methods, which limit the system performance and energy efficiency. In this paper, we put forward a coordinated warp scheduling and locality-protected (CWLP) cache allocation scheme to make full use of data locality and hide latency. We first present a locality-protected cache allocation method based on the instruction program counter (LPC) to promote cache performance. Specifically, we use a PC-based locality detector to collect the reuse information of each cache line and employ a prioritised cache allocation unit (PCAU) which coordinates the data reuse information with the time-stamp information to evict the lines with the least reuse possibility. Moreover, the locality information is used by the warp scheduler to create an intelligent warp reordering scheme to capture locality and hide latency. Simulation results show that CWLP provides a speedup up to 19.8% and an average improvement of 8.8% over the baseline methods.

Keywords

Locality / Graphics processing unit (GPU) / Cache allocation / Warp scheduling

Cite this article

Download citation ▾
Yang ZHANG, Zuo-cheng XING, Cang LIU, Chuan TANG. CWLP:coordinatedwarp scheduling and locality-protected cache allocation onGPUs. Front. Inform. Technol. Electron. Eng, 2018, 19(2): 206‒220 https://doi.org/10.1631/FITEE.1700059

RIGHTS & PERMISSIONS

2018 Zhejiang University and Springer-Verlag GmbH Germany, part of Springer Nature 2018
PDF(757 KB)

Accesses

Citations

Detail

Sections
Recommended

/