WYWenbo Yin

Wenbo Yin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Wenbo Yin has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Efficient Design Space Exploration Framework for FPGA Overlay Accelerators through Frequency Prediction and Bayesian Optimization

    by Qilong Zhu, Yunfei Dai, Shiyan Bi, Huizhen Kuang, Wenbo Yin, Tim Vanderhoek, Jahanzeb Ahmad, Lingli Wang

    In edge AI inference, FPGA Overlay Accelerators offer superior performance-area balance but often lack accurate maximum frequency prediction and efficient Design Space Exploration (DSE) due to complex parameterization. To address these limitations, we propose a Bayesian optimization-based DSE framework using the Tree-Structured Parzen Estimator. We introduce dependency-aware design space modeling (DAM) to prune the parameter space and a custom regression predictor (CREP) for frequency. To accommodate varying computational constraints, we present two implementations: a lightweight framework, DEFA, and an advanced framework, DEFA-ML. DEFA saves computational cost of CREP and exploration runtime for rapid optimization. Conversely, DEFA-ML leverages a complex prediction model and a Large Language Model assistant for superior optimization quality. We validate the framework on the Altera FPGA AI Suite. For frequency prediction, DEFA provides fast and conservative predictions, while DEFA-ML achieves high linearity with a mean absolute percentage error of 4.21%. In throughput optimization, compared with the FPGA AI Suite baseline optimizer, DEFA improves throughput by 30.16% and DEFA-ML improves by 35.12%. In area-throughput tradeoff optimization, compared with the baseline, DEFA improves by 39.05% and DEFA-ML improves by 43.11% for a single target model. For multiple target models, DEFA improves by 40.76% and DEFA-ML improves by 47.66%.

  • Toward Efficient Edge AI With Heterogeneous Computing and Multilevel Optimization

    by Jingyuan Li, Xinyu Cai, Yuan Dai, Wenbo Yin, Lingli Wang

    The rapid progress of artificial intelligence (AI) has brought increasing demands on hardware accelerators, particularly as modern models combine dense linear operations with a growing number of irregular, nonlinear, and control-intensive operators. While tensor cores and systolic arrays offer high throughput for regular computations, they often struggle to efficiently support the diverse operations emerging in recent model structures. Coarse-grained reconfigurable arrays (CGRAs), with their spatial parallelism and reconfigurability, may serve as a natural complement to dense accelerators in such heterogeneous workloads. In this work, we propose EUREKA, a heterogeneous acceleration framework that integrates tensor cores with CGRAs through a unified instruction set, cross-architecture data scheduling, tailored hardware support for nonlinear operators, and optimizations at the instruction, task, and operator levels to exploit parallelism. At the software level, we introduce a hierarchical compilation strategy that combines graph-level optimizations with tensor-level scheduling techniques. To address the large design space of hardware–software co-optimization, we further develop a Bayesian optimization-based exploration scheme enhanced with kernel compression methods, which provides an efficient means of identifying promising hardware configurations and scheduling strategies. Experiment results on representative AI benchmarks show that EUREKA improves execution efficiency, achieving an average $12.6\times $ normalized performance gain over state-of-the-art frameworks.

  • TransMap: Transformer-Enhanced Divide-and-Conquer Reinforcement Learning Framework for Efficient CGRA Compilation

    by Jingyuan Li, Wenbo Yin, Lingli Wang

    Coarse-grained reconfigurable architectures (CGRAs) combine flexibility with high performance, making them a promising solution for data-intensive computing. CGRA compilers are essential for determining how data flow graphs (DFGs) are executed on hardware. Recently, machine learning-based compilers have garnered significant attention for CGRA compilation. However, few deep learning compilers leverage the rich attentional information between DFGs and the CGRA abstractions effectively. Meanwhile, traditional compilers continue to struggle with inadequate compilation quality and long compilation time. In this paper, we propose a novel deep learning-based compiler that integrates transformer encoders with reinforcement learning (RL) to address these issues. The transformer encoder captures task dependencies by embedding feature maps from both the DFG and CGRA abstraction. Additionally, we design a tree-structured RL agent that employs spectral clustering to explore the extensive mapping solution space, optimizing task-to-resource allocation. Experimental results demonstrate that our method outperforms state-of-the-art (SOTA) compilers, achieving an average 1.22× improvement in compilation quality, a 33.39% increase in throughput, and a 12.83× speedup in compilation time, underscoring its potential to enhance CGRA performance.


  • Dependency-Aware Data Parallelism on Spatial CGRA via Constraint Satisfaction and Graph Coloring

    by Yuan Dai, Xuchen Gao, Huan Lin, Wenbo Yin, Wai-Shing Luk, Lingli Wang

    Coarse-grained Reconfigurable Architecture (CGRA) is a competitive accelerator architecture for computation-intensive loop kernels. Spatial CGRA is a typical CGRA that performs all the operations spatially to reduce reconfiguration costs within a single iteration, demanding high data parallelism. To achieve this goal, one of the main challenges is the loop-carried dependency between memory accesses. Many existing CGRA compilers struggle to precisely analyze the dependency distance, especially when accesses involve complex address patterns. Consequently, these compilers often default to setting the distance to one, based on a worst-case assumption, leading to degraded performance. However, we observe that a precise distance can improve performance significantly, raising the requirement for an efficient distance calculation approach. Another challenge is the performance constraints of single-bank memory, which necessitate the designer partitioning the original data into a multi-bank memory. However, we observe that the mapping result can cause the inter-iteration conflict, thereby invalidating the memory partition scheme. Therefore, an efficient post-mapping conflict detection is required. In this paper, we develop a constraint satisfaction problem (CSP)-based approach for calculating dependency distance and detecting conflicts, which determines the maximum available dependency distance and identifies conflicts within both intra- and inter-iterations. Besides, we formulate access scheduling as a graph coloring problem, which can minimize conflicts and improve performance. Overall, we develop a comprehensive end-to-end framework with architectural and compiler support for efficient data parallelism on spatial CGRA. We conduct extensive experiments to systematically evaluate the impact of different approaches on performance and compilation. Evaluation results show that our architecture can achieve 13.16× and 1.19× (up to 1.68×) average performance improvements compared to a RISC-V CPU and a state-of-the-art CGRA SoC, respectively. Besides, our architecture has 7.38× and 1.18× (up to 1.65×) average energy efficiency gains compared to these two architectures.


  • Toward Efficient Logarithmic Converter Circuit Design via Constraint-Driven Parameter Exploration

    by Guibin Zou, Yuan Dai, Wenbo Yin, Lingli Wang

    As a core component of logarithmic number systems, this brief proposes a constraint-driven automated parameter exploration framework for the logarithmic converter circuit. The framework innovatively integrates two optimization algorithms, including the Intercept Compensation and Error-Flattening Non-Uniform Segmentation Scheme for high-precision implementations and the Unity-Slope Piecewise Linear Approximation for low-precision implementations that require less hardware overhead. Employing constraint-driven automated exploration of adder count, segment count, error-redundancy factor, and segment-point bit-width, optimal parameters are selected for an optimized logarithmic converter implementation. Experimental results demonstrate that compared to state-of-the-art designs with identical maximum absolute error constraints, the proposed circuits achieve superior area (up to 62.7% reduction), power (up to 62.4% reduction), and delay (up to 29.9% reduction), yielding 7.3%–88.5% improvements in the comprehensive error-area-delay-power (eADP) metric.


  • Open Access

    MoDAF: A Multi-objective Divide-and-Conquer Parameter Tuning Framework for CGRAs

    by Jingyuan Li, Yuan Dai, Wenbo Yin, Lingli Wang

    Coarse-grained reconfigurable architectures (CGRAs) are gaining increasing attention as domain-specific accelerators due to their high flexibility and energy efficiency. These architectures offer a compelling solution for applications that require custom hardware performance while retaining a degree of programmability. However, the design space of CGRAs is inherently vast and complex, presenting significant challenges for architects to explore design choices efficiently and systematically. Existing design space exploration (DSE) methodologies for CGRAs are often time-demanding and struggle to deliver optimal solutions when confronted with high-dimensional and multi-objective design space. Therefore, we consider constructing a CGRA parameter tuning framework called MoDAF. MoDAF initializes the design space using the most representative and diverse samples. It adopts a divide-and-conquer approach, utilizing Monte Carlo Tree Search (MCTS) and space partitioning techniques to dynamically break down the complex design space into more manageable subspaces. A hybrid model handles local fluctuations within each subspace, while a dual sampling algorithm is designed to increase sampling efficiency. MoDAF also incorporates a fast evaluation model to estimate CGRA throughput and area, significantly speeding up the exploration process. Compared with previous approaches, experiments show that our proposed framework reduces the average distance from the reference set by 53.0% and the hypervolume deviation by 64.2%, while also cutting wall time by 57.5%.


  • COFFA: A Co-Design Framework for Fused-Grained Reconfigurable Architecture Towards Efficient Irregular Loop Handling

    by Yuan Dai, Xuchen Gao, Yunhui Qiu, Jingyuan Li, Yuhang Cao, Yiqing Mao, Sichao Chen, Wenbo Yin, Wai-Shing Luk, Lingli Wang

    Coarse-Grained Reconfigurable Architecture (CGRA) emerges as a competitive accelerator due to its high flexibility and energy efficiency. However, most CGRAs are effective for computation-intensive applications with regular loops but struggle with irregular loops containing control flows. These loops introduce fine-grained logic operations and are costly to execute by coarse-grained arithmetic units in CGRA. Efficiently handling such logic operations necessitates incorporating Boolean algebra optimization, which can improve logic density and reduce logic depth. Unfortunately, no previous research has incorporated it into the compilation flow to support irregular loops efficiently. We propose COFFA, an open-source framework for heterogeneous architecture with a RISC-V CPU and a fused-grained reconfigurable accelerator, which integrates coarse-grained arithmetic and fine-grained logic units, along with flexible IO units and distributed interconnects. As a software/hardware co-design framework, COFFA has a powerful compiler that extracts and optimizes fine-grained logic operations from irregular loops, performs coarse-grained arithmetic and memory optimizations, and offloads the loops to the accelerator. Across various challenging benchmarks with irregular loops, COFFA achieves significant performance and energy efficiency improvements over an in-order, an out-of-order RISC-V CPUs, and a recent FPGA, respectively. Moreover, compared with the state-of-the-art CGRA UE-CGRA and Hycube, COFFA can achieve 2.5$\times$ and 3.5$\times$ performance gains, respectively.


  • Open Access

    Towards Efficient Data Parallelism on Spatial CGRA via Constraint Satisfaction and Graph Coloring

    by Yuan Dai, Xuchen Gao, Chen Shen, Bingbing Peng, Wenbo Yin, Wai-Shing Luk, Lingli Wang

    Coarse-Grained Reconfigurable Architecture (CGRA) is a competitive accelerator architecture for computation-intensive loop kernels. Spatial CGRA is a typical CGRA that performs all the operations spatially, demanding high data parallelism. Given the performance limitations of single-bank memory, partitioning original data into multi-bank memory within the spatial CGRA is favored. However, we observe that the mapping result can cause the inter-iteration conflict, thereby invalidating the memory partition scheme. In this paper, we develop a constraint satisfaction problem-based conflict detection approach capable of detecting the conflict in intra- and inter-iterations within a partition scheme. Besides, we formulate access scheduling as a graph coloring problem, which can minimize conflicts and improve performance. Overall, we develop a comprehensive end-to-end framework with architectural and compiler support for efficient data parallelism on the spatial CGRA. Experimental results show that our architecture can achieve 13.79×, 2.35×, and 1.16× average improvement in performance, compared with an in-order RISC-V CPU, a mainstream FPGA, and a state-of-the-art CGRA SoC (FDRA), respectively. Besides, our architecture has 7.72×, 2.44×, and 1.14× average energy efficiency gains against these three architectures. Finally, at the CGRA level, our CGRA can achieve a 1.53× energy efficiency gain over the CASCADE CGRA.


  • Open Access

    HierCGRA: A Novel Framework for Large-scale CGRA with Hierarchical Modeling and Automated Design Space Exploration

    by Sichao Chen, Chang Cai, Su Zheng, Jiangnan Li, Guowei Zhu, Jingyuan Li, Yazhou Yan, Yuan Dai, Wenbo Yin, Lingli Wang

    Coarse-grained reconfigurable arrays (CGRAs) are promising design choices in computation-intensive domains, since they can strike a balance between energy efficiency and flexibility. A typical CGRA comprises processing elements (PEs) that can execute operations in applications and interconnections between them. Nevertheless, most CGRAs suffer from the ineffectiveness of supporting flexible architecture design and solving large-scale mapping problems. To address these challenges, we introduce HierCGRA, a novel framework that integrates hierarchical CGRA modeling, Chisel-based Verilog generation, LLVM-based data flow graph (DFG) generation, DFG mapping, and design space exploration (DSE). With the graph homomorphism (GH) mapping algorithm, HierCGRA achieves a faster mapping speed and higher PE utilization rate compared with the existing state-of-the-art CGRA frameworks. The proposed hierarchical mapping strategy achieves 41× speedup on average compared with the ILP mapping algorithm in CGRA-ME. Furthermore, the automated DSE based on Bayesian optimization achieves a significant performance improvement by the heterogeneity of PEs and interconnections. With these features, HierCGRA enables the agile development for large-scale CGRA and accelerates the process of finding a better CGRA architecture.


  • Open Access

    FDRA: A Framework for a Dynamically Reconfigurable Accelerator Supporting Multi-Level Parallelism

    by Yunhui Qiu, Yiqing Mao, Xuchen Gao, Sichao Chen, Jiangnan Li, Wenbo Yin, Lingli Wang

    Coarse-grained reconfigurable architectures (CGRAs) have emerged as promising accelerators due to their high flexibility and energy efficiency. However, existing open source works often lack integration of CGRAs with CPU systems and corresponding toolchains. Moreover, there is rare support for the accelerator instruction pipelining to overlap data communication, computation, and configuration across multiple tasks. In this article, we propose FDRA, an open source exploration framework for a heterogeneous system-on-chip (SoC) with a RISC-V processor and a dynamically reconfigurable accelerator (DRA) supporting loop, instruction, and task levels of parallelism. FDRA encompasses parameterized SoC modeling, Verilog generation, source-to-source application code transformation using frontend and DRA compilers, SoC simulation, and FPGA prototyping. FDRA incorporates the extraction of periodic accumulative operators and multi-dimensional linear load/store operators from nested loops. The DRA enables accessing the shared L2 cache with virtual addresses and supports direct memory access with arbitrary start addresses and data lengths. Integrated into the RISC-V Rocket SoC, our DRA achieves a remarkable 55× acceleration for loop kernels and improves energy efficiency by 29×. Compared to state-of-the-art RISC-V vector units, our DRA demonstrates a 2.9× speed improvement and 3.5× greater energy efficiency. In contrast to previous CGRA+RISC-V SoCs, our SoC achieves a minimum speedup of 5.2×.