Graph Neural Networks for High-Level Synthesis Design Space Exploration

被引:15
作者
Ferretti, Lorenzo [1 ]
Cini, Andrea [2 ]
Zacharopoulos, Georgios [3 ,5 ]
Alippi, Cesare [2 ]
Pozzi, Laura [4 ]
机构
[1] Univ Calif Los Angeles, Engn 6,404 Westwood Plaza, Los Angeles, CA 90095 USA
[2] Univ Svizzera Italiana, IDSIA, Via Santa 1, CH-6962 Lugano, Switzerland
[3] Huawei Zurich Res Ctr, Comp Syst Lab, Zurich, Switzerland
[4] Univ Svizzera Italiana, Lugano, Switzerland
[5] Huawei Technol, Zurich Res Ctr, Thurgauerstr 40, CH-8050 Zurich, Switzerland
关键词
Design space exploration; high-level synthesis; graph neural networks; PARETO ITERATIVE REFINEMENT; OPTIMIZATION;
D O I
10.1145/3570925
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
High-level Synthesis (HLS) Design-Space Exploration (DSE) aims at identifying Pareto-optimal synthesis configurations whose exhaustive search is unfeasible due to the design-space dimensionality and the prohibitive computational cost of the synthesis process. Within this framework, we address the design automation problem by proposing graph neural networks that jointly predict acceleration performance and hardware costs of a synthesized behavioral specification given optimization directives. Learned models can be used to rapidly approach the Pareto curve by guiding the DSE, taking into account performance and cost estimates. The proposed method outperforms traditional HLS-driven DSE approaches, by accounting for the arbitrary length of computer programs and the invariant properties of the input. We propose a novel hybrid control and dataflow graph representation that enables training the graph neural network on specifications of different hardware accelerators. Our approach achieves prediction accuracy comparable with that of state-of-the-art simulators without having access to analytical models of the HLS compiler. Finally, the learned representation can be exploited for DSE in unexplored configuration spaces by fine-tuning on a small number of samples from the new target domain. The outcome of the empirical evaluation of this transfer learning shows strong results against state-of-the-art baselines in relevant benchmarks.
引用
收藏
页数:20
相关论文
共 56 条
[1]  
AHMAD I, 1994, 1994 IEEE 13TH ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS, P491
[2]   Multitask learning [J].
Caruana, R .
MACHINE LEARNING, 1997, 28 (01) :41-75
[3]   SODA: Stencil with Optimized Dataflow Architecture [J].
Chi, Yuze ;
Cong, Jason ;
Wei, Peng ;
Zhou, Peipei .
2018 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD) DIGEST OF TECHNICAL PAPERS, 2018,
[4]   FLASH: Fast, Parallel, and Accurate Simulator for HLS [J].
Choi, Young-Kyu ;
Chi, Yuze ;
Wang, Jie ;
Cong, Jason .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (12) :4828-4841
[5]   HLS-Based Optimization and Design Space Exploration for Applications with Variable Loop Bounds [J].
Choi, Young-kyu ;
Cong, Jason .
2018 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD) DIGEST OF TECHNICAL PAPERS, 2018,
[6]  
Choi YK, 2017, ICCAD-IEEE ACM INT, P691
[7]   PolySA: Polyhedral-Based Systolic Array Auto-Compilation [J].
Cong, Jason ;
Wang, Jie .
2018 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD) DIGEST OF TECHNICAL PAPERS, 2018,
[8]   DB4HLS: A Database of High-Level Synthesis Design Space Explorations [J].
Ferretti, Lorenzo ;
Kwon, Jihye ;
Ansaloni, Giovanni ;
Di Guglielmo, Giuseppe ;
Carloni, Luca ;
Pozzi, Laura .
IEEE EMBEDDED SYSTEMS LETTERS, 2021, 13 (04) :194-197
[9]   Leveraging Prior Knowledge for Effective Design-Space Exploration in High-Level Synthesis [J].
Ferretti, Lorenzo ;
Kwon, Jihye ;
Ansaloni, Giovanni ;
Di Guglielmo, Giuseppe ;
Carloni, Luca P. ;
Pozzi, Laura .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (11) :3736-3747
[10]   Cluster-Based Heuristic for High Level Synthesis Design Space Exploration [J].
Ferretti, Lorenzo ;
Ansaloni, Giovanni ;
Pozzi, Laura .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2021, 9 (01) :35-43