Toward Efficient FPGA Accelerator DSE via Hierarchical and RM-Guided Methods

field-programmable gate array (FPGA) accelerator design has gradually become a mainstream acceleration solution, widely applied in fields, such as large language models, deep learning inference, autonomous driving, real-time 3-D scene reconstruction, and embedded intelligent terminals. high-level sy...

Full description

Saved in:
Bibliographic Details
Published in:IEEE embedded systems letters Vol. 17; no. 5; pp. 361 - 364
Main Authors: Shi, Chao, Cheng, Qianyu, Wang, Teng, Wang, Chao, Zhou, Xuehai
Format: Journal Article
Language:English
Published: IEEE 01.10.2025
Subjects:
Costs
Deep learning
design space exploration (DSE)
Field programmable gate arrays
field-programmable gate array (FPGA) accelerator
high-level synthesis (HLS)
Large language models
Manuals
Real-time systems
rule mining (RM)
Scalability
Space exploration
Three-dimensional displays
Tuning
ISSN:1943-0663, 1943-0671
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:field-programmable gate array (FPGA) accelerator design has gradually become a mainstream acceleration solution, widely applied in fields, such as large language models, deep learning inference, autonomous driving, real-time 3-D scene reconstruction, and embedded intelligent terminals. high-level synthesis (HLS) technology has provided significant support for FPGA accelerator design, greatly improving design efficiency and flexibility. However, manual parameter tuning by designers is still required to achieve optimal performance. Existing research has proposed automated design space exploration (DSE) methods to assist in parameter tuning, but these methods often exhibit low efficiency when dealing with complex HLS designs and, in some cases, fail to function properly. To address this, we present an efficient DSE method guided by hierarchical analysis and rule mining (RM), aimed at tackling more complex design challenges. This approach performs hierarchical analysis of design solutions and integrates RM techniques to optimize the design space search process, enabling efficient exploration of superior design solutions. Experimental results show that our method achieves performance comparable to state-of-the-art (SOTA) techniques, while delivering a speed-up of <inline-formula> <tex-math notation="LaTeX">3.6{\times } </tex-math></inline-formula> to <inline-formula> <tex-math notation="LaTeX">30.4{\times } </tex-math></inline-formula>. Moreover, it enables the effective exploration of complex design spaces that existing methods struggle to handle.
ISSN:1943-0663
1943-0671
DOI:10.1109/LES.2025.3600555