MSHR-Aware Dynamic Warp Scheduler for High Performance GPUs


KIPS Transactions on Computer and Communication Systems, Vol. 8, No. 5, pp. 111-118, May. 2019
https://doi.org/10.3745/KTCCS.2019.8.5.111,   PDF Download:  
Keywords: GPU, Warp Scheduling, Cache, MSHR, Parallelism
Abstract

Recent graphic processing units (GPUs) provide high throughput by using powerful hardware resources. However, massive memory accesses cause GPU performance degradation due to cache inefficiency. Therefore, the performance of GPU can be improved by reducing thread parallelism when cache suffers memory contention. In this paper, we propose a dynamic warp scheduler which controls thread parallelism according to degree of cache contention. Usually, the greedy then oldest (GTO) policy for issuing warp shows lower parallelism than loose round robin (LRR) policy. Therefore, the proposed warp scheduler employs the LRR warp scheduling policy when Miss Status Holding Register(MSHR) utilization is low. On the other hand, the GTO policy is employed in order to reduce thread parallelism when MSHRs utilization is high. Our proposed technique shows better performance compared with LRR and GTO policy since it selects efficient scheduling policy dynamically. According to our experimental results, our proposed technique provides IPC improvement by 12.8% and 3.5% over LRR and GTO on average, respectively.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
G. B. Kim, J. M. Kim and C. H. Kim, "MSHR-Aware Dynamic Warp Scheduler for High Performance GPUs," KIPS Transactions on Computer and Communication Systems, vol. 8, no. 5, pp. 111-118, 2019. DOI: https://doi.org/10.3745/KTCCS.2019.8.5.111.

[ACM Style]
Gwang Bok Kim, Jong Myon Kim, and Cheol Hong Kim. 2019. MSHR-Aware Dynamic Warp Scheduler for High Performance GPUs. KIPS Transactions on Computer and Communication Systems, 8, 5, (2019), 111-118. DOI: https://doi.org/10.3745/KTCCS.2019.8.5.111.