μC-States
Authors:
Open Access
- 11 September 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 17-30
Abstract
To improve the performance of Graphics Processing Units (GPUs) beyond simply increasing core count, architects are recently adopting a scale-up approach: the peak throughput and individual capabilities of the GPU cores are increasing rapidly. This big-core trend in GPUs leads to various challenges, including higher static power consumption and lower and imbalanced utilization of the datapath components of a big core. As we show in this paper, two key problems ensue: (1) the lower and imbalanced datapath utilization can waste power as an application does not always utilize all portions of the big core datapath, and (2) the use of big cores can lead to application performance degradation in some cases due to the higher memory system contention caused by the more memory requests generated by each big core. This paper introduces a new analysis of datapath component utilization in big-core GPUs based on queuing theory principles. Building on this analysis, we introduce a fine-grained dynamic power- and clock-gating mechanism for the entire datapath, called μC-States, which aims to minimize power consumption by turning off or tuning-down datapath components that are not bottlenecks for the performance of the running application. Our experimental evaluation demonstrates that μC-States significantly reduces both static and dynamic power consumption in a big-core GPU, while also significantly improving the performance of applications affected by high memory system contention. We also show that our analysis of datapath component utilization can guide scheduling and design decisions in a GPU architecture that contains heterogeneous cores.Keywords
Funding Information
- NSF (1205618)
This publication has 71 references indexed in Scilit:
- A case for core-assisted bottleneck acceleration in GPUs2015
- MISE: Providing performance predictability and improving fairness in shared main memory systems2013
- Bottleneck identification and scheduling in multithreaded applications2012
- Parallel application memory scheduling2011
- Improving GPU performance via large warps and two-level warp scheduling2011
- Reducing memory interference in multicore systems via application-aware memory channel partitioning2011
- AérgiaACM SIGARCH Computer Architecture News, 2010
- Leakage current mechanisms and leakage reduction techniques in deep-submicrometer CMOS circuitsProceedings of the IEEE, 2003
- Energy-effective issue logicACM SIGARCH Computer Architecture News, 2001
- A Proof for the Queuing Formula: L = λWOperations Research, 1961