A Unified Memory Dependency Framework for Speculative High-Level Synthesis

被引:4
作者
Gorius, Jean-Michel [1 ]
Rokicki, Simon [1 ]
Derrien, Steven [1 ]
机构
[1] Univ Rennes, INRIA, CNRS, IRISA, Rennes, France
来源
PROCEEDINGS OF THE 33RD ACM SIGPLAN INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION, CC 2024 | 2024年
关键词
High-Level Synthesis; speculation; memory dependencies; code generation; COMPUTATION;
D O I
10.1145/3640537.3641581
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Heterogeneous hardware platforms that leverage applicationspecific hardware accelerators are becoming increasingly popular as the demand for high-performance compute intensive applications rises. The design of such high-performance hardware accelerators is a complex task. High-Level Synthesis (HLS) promises to ease this process by synthesizing hardware from a high-level algorithmic description. Recent works have demonstrated that speculative execution can be inferred from the latter by leveraging compilation transformation and analysis techniques in HLS flows. However, existing work on speculative HLS lacks support for the intricate memory interactions in data-processing applications. In this paper, we introduce a unified memory speculation framework, which allows aggressive scheduling and highthroughput accelerator synthesis in the presence of complex memory dependencies. We show that our technique can generate high-throughput designs for various applications and describe a complete implementation inside an existing speculative HLS toolchain.
引用
收藏
页码:13 / 25
页数:13
相关论文
共 43 条
[1]  
Alle M, 2013, DES AUT CON
[2]  
AMD Xilinx, 2023, Vitis High-Level Synthesis User Guide (UG1399)
[3]  
Bhowmik A., 2002, P 14 ACM S PARALLEL, P99
[4]   A Practical Automatic Polyhedral Parallelizer and Locality Optimizer [J].
Bondhugula, Uday ;
Hartono, Albert ;
Ramanujam, J. ;
Sadayappan, R. .
PLDI'08: PROCEEDINGS OF THE 2008 SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN & IMPLEMENTATION, 2008, :101-+
[5]  
Canis A, 2011, FPGA 11: PROCEEDINGS OF THE 2011 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD PROGRAMMABLE GATE ARRAYS, P33
[6]   REGISTER ALLOCATION VIA COLORING [J].
CHAITIN, GJ ;
AUSLANDER, MA ;
CHANDRA, AK ;
COCKE, J ;
HOPKINS, ME ;
MARKSTEIN, PW .
COMPUTER LANGUAGES, 1981, 6 (01) :47-57
[7]   Dynamic Hazard Resolution for Pipelining Irregular Loops in High-Level Synthesis [J].
Dai, Steve ;
Zhao, Ritchie ;
Liu, Gai ;
Srinath, Shreesha ;
Gupta, Udit ;
Batten, Christopher ;
Zhang, Zhiru .
FPGA'17: PROCEEDINGS OF THE 2017 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE GATE ARRAYS, 2017, :189-194
[8]   Toward Speculative Loop Pipelining for High-Level Synthesis [J].
Derrien, Steven ;
Marty, Thibaut ;
Rokicki, Simon ;
Yuki, Tomofumi .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (11) :4229-4239
[9]   Straight to the Queue: Fast Load-Store Queue Allocation in Dataflow Circuits [J].
Elakhras, Ayatallah ;
Sawhney, Riya ;
Guerrieri, Andrea ;
Josipovic, Lana ;
Ienne, Paolo .
PROCEEDINGS OF THE 2023 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD PROGRAMMABLE GATE ARRAYS, FPGA 2023, 2023, :39-45
[10]  
Elliott J.P., 1999, Understanding Behavioral Synthesis: A Practical Guide to High-Level Design