Advanced search
1 file | 1.93 MB
Author
Organization
Abstract
As integrated circuits are limited by hardware resources, reducing cost while maintaining the performance becomes especially important. In this article, we propose a conflict-free NoC (cfNoC) for the GPGPU request network. The cfNoC eliminates (i) conflicts among different columns by deploying an exclusive subnet for each column, and (ii) conflicts inside the same column by using a token-based mechanism. The elimination of conflicts allows cfNoC to exploit different subnet channel widths to maintain the performance while reducing cost. Compared with a baseline mesh with 1 VC, our work reduces request network area by 22.6% and power by 23.7%. With 2 VCs, cfNoC achieves more than 37.6% power reduction compared to the baseline and the checkboard placement/routing (CP) design. All these benefits do not cause any performance loss.
Keywords
GPGPU, Conflict-Free, Low-Cost, NoC

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.93 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Zhao, Xia, Sheng Ma, Yuxi Liu, Lieven Eeckhout, and Zhiying Wang. 2016. “A Low-cost Conflict-free NoC for GPGPUs.” In Proceedings of the 53rd Annual Design Automation Conference. New York, NY, USA: Association for Computing Machinery (ACM).
APA
Zhao, Xia, Ma, S., Liu, Y., Eeckhout, L., & Wang, Z. (2016). A low-cost conflict-free NoC for GPGPUs. Proceedings of the 53rd Annual Design Automation Conference. Presented at the 53rd Annual Design Automation Conference (DAC), New York, NY, USA: Association for Computing Machinery (ACM).
Vancouver
1.
Zhao X, Ma S, Liu Y, Eeckhout L, Wang Z. A low-cost conflict-free NoC for GPGPUs. Proceedings of the 53rd Annual Design Automation Conference. New York, NY, USA: Association for Computing Machinery (ACM); 2016.
MLA
Zhao, Xia, Sheng Ma, Yuxi Liu, et al. “A Low-cost Conflict-free NoC for GPGPUs.” Proceedings of the 53rd Annual Design Automation Conference. New York, NY, USA: Association for Computing Machinery (ACM), 2016. Print.
@inproceedings{7246075,
  abstract     = {As integrated circuits are limited by hardware resources, reducing cost while maintaining the performance becomes especially important. In this article, we propose a conflict-free NoC (cfNoC) for the GPGPU request network. The cfNoC eliminates (i) conflicts among different columns by deploying an exclusive subnet for each column, and (ii) conflicts inside the same column by using a token-based mechanism. The elimination of conflicts allows cfNoC to exploit different subnet channel widths to maintain the performance while reducing cost. Compared with a baseline mesh with 1 VC, our work reduces request network area by 22.6\% and power by 23.7\%. With 2 VCs, cfNoC achieves more than 37.6\% power reduction compared to the baseline and the checkboard placement/routing (CP) design. All these benefits do not cause any performance loss.},
  articleno    = {34},
  author       = {Zhao, Xia and Ma, Sheng and Liu, Yuxi and Eeckhout, Lieven and Wang, Zhiying},
  booktitle    = {Proceedings of the 53rd Annual Design Automation Conference},
  isbn         = {978-1-4503-4236-0},
  issn         = {0738-100X },
  language     = {eng},
  location     = {Austin, TX },
  pages        = {6},
  publisher    = {Association for Computing Machinery (ACM)},
  title        = {A low-cost conflict-free NoC for GPGPUs},
  url          = {http://dx.doi.org/10.1145/2897937.2897963},
  year         = {2016},
}

Altmetric
View in Altmetric
Web of Science
Times cited: