GATE: A generalized dataflow-level approximation tuning engine for data parallel architectures

  • Kang, Seokwon .
  • Yu, Yongseung
  • Kim, Jiho
  • Park, Yongjun
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

1

초록

Although approximate computing is widely used, it requires substantial programming effort to find appropriate approximation patterns among multiple pre-defined patterns to achieve a high performance. Therefore, we propose an automatic approximation framework called GATE to uncover hidden opportunities from any data-parallel program regardless of the code pattern or application characteristics using two compiler techniques, namely subgraph-level approximation (SGLA) and approximate thread merge(ATM). GATE also features conservative/aggressive tuning and dynamic calibration to maximize the performance while maintaining the TOQ level during runtime. Our framework achieves an average performance gain of 2.54x over the baseline with minimum accuracy loss.

키워드

Application programsComputer aided designProgram compilersAccuracy lossCode-patternsCompiler techniquesData parallelData-parallel architecturesDynamic calibrationOR applicationsPerformance GainParallel architectures
제목
GATE: A generalized dataflow-level approximation tuning engine for data parallel architectures
저자
Kang, Seokwon .Yu, YongseungKim, JihoPark, Yongjun
DOI
10.1145/3316781.3317833
발행일
2019-06
유형
Conference Paper
저널명
Proceedings - Design Automation Conference
페이지
1 ~ 6