Power-efficient Computing for Compute-intensive GPGPU Applications

被引:0
|
作者
Gilani, Syed Zohaib [1 ]
Kim, Nam Sung [1 ]
Schulte, Michael J.
机构
[1] Univ Wisconsin, Madison, WI 53706 USA
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The peak compute performance of GPUs has been increased by integrating more compute resources and operating them at higher frequency. However, such approaches significantly increase power consumption of GPUs, limiting further performance increase due to the power constraint. Facing such a challenge, we propose three techniques to improve power efficiency and performance of GPUs in this paper. First, we observe that many GPGPU applications are integer-intensive. For such applications, we combine a pair of dependent integer instructions into a composite instruction that can be executed by an enhanced fused multiply-add unit. Second, we observe that computations for many instructions are duplicated across multiple threads. We dynamically detect such instructions and execute them in a separate scalar unit. Finally, we observe that 16 or fewer bits are sufficient for accurate representation of operands and results of many instructions. Thus, we split the 32-bit datapath into two 16-bit datapath slices that can concurrently issue and execute up to two such instructions per cycle. All three proposed techniques can considerably increase utilization of compute resources, improving power efficiency and performance by 20% and 15%, respectively.
引用
收藏
页码:330 / 341
页数:12
相关论文
共 50 条
  • [31] A load balance methodology for highly compute-intensive applications on grids based on computational modeling
    Martínez, DR
    Albín, JL
    Cabaleiro, JC
    Pena, TF
    Rivera, FF
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2005: OTM 2005 WORKSHOPS, PROCEEDINGS, 2005, 3762 : 327 - 336
  • [32] OPTIMAL SCHEDULING OF COMPUTE-INTENSIVE TASKS ON A NETWORK OF WORKSTATIONS
    EFE, K
    KRISHNAMOORTHY, V
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (06) : 668 - 673
  • [33] Optimal scheduling of compute-intensive tasks on a network of workstations
    Univ of Southwestern Louisiana, Lafayette, LA, United States
    IEEE Trans Parallel Distrib Syst, 6 (668-673):
  • [34] Integration of compute-intensive tasks into scientific workflows in BeesyCluster
    Czarnul, Pawel
    COMPUTATIONAL SCIENCE - ICCS 2006, PT 3, PROCEEDINGS, 2006, 3993 : 944 - 947
  • [35] Analyzing Energy-Efficiency of Two Scheduling Policies in Compute-Intensive Applications on Cloud
    Kuang, Ping
    Guo, Wenxia
    Xu, Xiang
    Li, Hongjian
    Tian, Wenhong
    Buyya, Rajkumar
    IEEE ACCESS, 2018, 6 : 45515 - 45526
  • [36] Deployment of Run-Time Reconfigurable Hardware Coprocessors Into Compute-Intensive Embedded Applications
    Francisco Fons
    Mariano Fons
    Enrique Cantó
    Mariano López
    Journal of Signal Processing Systems, 2012, 66 : 191 - 221
  • [37] DIGITAL OPTICAL COMPUTING ARCHITECTURES FOR COMPUTE INTENSIVE APPLICATIONS
    GUILFOYLE, PS
    OPTICAL COMPUTING, 1995, 139 : 37 - 40
  • [38] Practical Strategies for Power-Efficient Computing Technologies
    Chang, Leland
    Frank, David J.
    Montoye, Robert K.
    Koester, Steven J.
    Ji, Brian L.
    Coteus, Paul W.
    Dennard, Robert H.
    Haensch, Wilfried
    PROCEEDINGS OF THE IEEE, 2010, 98 (02) : 215 - 236
  • [39] Efficient calculation of compute-intensive fitness in genetic computations using a survival indicator for population members
    Edelson, W
    Gargano, ML
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 784 - 784
  • [40] Principles for designing data-/compute-intensive distributed applications and middleware systems for heterogeneous environments
    Kim, Jik-Soo
    Andrade, Henrique
    Sussman, Alan
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2007, 67 (07) : 755 - 771