Yuhang Qiu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuhang Qiu has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Dongrui Fan
Institute of Computing Technology Chinese Academy of Sciences
3 shared publications - Wenming Li
Institute of Computing Technology Chinese Academy of Sciences
3 shared publications - Xiaochun Ye
Institute of Computing Technology Chinese Academy of Sciences
3 shared publications - Zhihua Fan
Institute of Computing Technology Chinese Academy of Sciences
3 shared publications - Tianyu Liu
State Key Lab of Processors, Institute of Computing Technology, CAS, Beijing, China
2 shared publications - Xuejun An
Institute of Computing Technology Chinese Academy of Sciences
2 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
An ISA-Centric RISC-V Heterogeneous Architecture for Energy Efficient Ray Tracing Pipeline Acceleration
Ray tracing (RT) is increasingly used in interactive graphics and edge rendering, but efficient deployment remains difficult because its two major phases, BVH construction and BVH traversal, have fundamentally different computation patterns, precision requirements, and architectural affinities. Existing designs largely optimize these phases in isolation and therefore do not provide an efficient full-pipeline solution. We present an ISA-centric RISC-V heterogeneous architecture for energy-efficient RT acceleration through phase-aware hardware-software co-design. The design has three components: a full-BVH compression framework that combines exact lossless compression for leaf-triangle blocks with conservative multi-level quantization for AABBs and rays; custom RISC-V ISA extensions for both vectorized BVH-construction kernels and correctness-preserving low-precision traversal; and a phase-aware heterogeneous organization that couples a RVV-enhanced core for construction with a precision-aware traversal coprocessor. For BVH construction, our design achieves speedups of 2.38 × and 1.97 × over XT910 with RVV for SAH-2 and LBVH-2. Compared with Jetson AGX Orin across different BVH widths (BVH2/4/6/8), our design achieves up to 1.59× and 1.77× speedups for SAH and LBVH, while consuming only 20.53%–32.46% of its energy. For BVH traversal, it achieves 1.42 × speedup over AQB8, while consuming only 31.79% of AQB8’s energy. Across different BVH widths, our design achieves up to 2.50× and 2.64× speedups for SAH and LBVH over Orin, while consuming only 27.19%–51.02% of its energy. These results demonstrate that phase-aware ISA-centric design enables efficient, programmable full-pipeline ray tracing.
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
Open AccessAn ISA-Centric RISC-V Heterogeneous Architecture for Energy Efficient Ray Tracing Pipeline Acceleration
Ray tracing (RT) is increasingly used in interactive graphics and edge rendering, but efficient deployment remains difficult because its two major phases, BVH construction and BVH traversal, have fundamentally different computation patterns, precision requirements, and architectural affinities. Existing designs largely optimize these phases in isolation and therefore do not provide an efficient full-pipeline solution. We present an ISA-centric RISC-V heterogeneous architecture for energy-efficient RT acceleration through phase-aware hardware-software co-design. The design has three components: a full-BVH compression framework that combines exact lossless compression for leaf-triangle blocks with conservative multi-level quantization for AABBs and rays; custom RISC-V ISA extensions for both vectorized BVH-construction kernels and correctness-preserving low-precision traversal; and a phase-aware heterogeneous organization that couples a RVV-enhanced core for construction with a precision-aware traversal coprocessor. For BVH construction, our design achieves speedups of 2.38 × and 1.97 × over XT910 with RVV for SAH-2 and LBVH-2. Compared with Jetson AGX Orin across different BVH widths (BVH2/4/6/8), our design achieves up to 1.59× and 1.77× speedups for SAH and LBVH, while consuming only 20.53%–32.46% of its energy. For BVH traversal, it achieves 1.42 × speedup over AQB8, while consuming only 31.79% of AQB8’s energy. Across different BVH widths, our design achieves up to 2.50× and 2.64× speedups for SAH and LBVH over Orin, while consuming only 27.19%–51.02% of its energy. These results demonstrate that phase-aware ISA-centric design enables efficient, programmable full-pipeline ray tracing.
- Open Access
- 16 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-23
Compressing and Accelerating Sparse CNNs Using Sign-Reserved Toeplitz Filters and Input Activation Density-aware Dataflow
Exploiting the sparsity in convolutional neural networks is crucial to accelerate computing and reduce energy consumption. Unstructured sparsity, benefiting from its flexibility to accommodate arbitrary sparse patterns, generally achieves higher accuracy, but it often introduces irregularity in convolutional operations, which complicates the control logic and undermines the benefits of sparsification. Structured sparsity alleviates these problems but sacrifices its application flexibility, which leads to lower accuracy. In this article, we propose TSCNN, an algorithm-hardware co-design solution that aims to compress and accelerate sparse CNNs while balancing both adaptability to sparsity and computational efficiency. In terms of algorithm, TSCNN adopts pruned filters compressed with sign-reserved Toeplitz matrix format (Tfilters), which systematically enhances the regularity of data reuse and flexibly reduces network parameters by 44%-86% while maintaining accuracy. In terms of hardware, TSCNN accelerator adapts to the structure of Tfilters and utilizes density-aware dataflows to support input activations with large sparsity variation, further optimizing the computational efficiency. Experiments show that TSCNN outperforms a dense CNN accelerator, sparse CNN accelerators SCNN and CSCNN, achieving 5.31× , 2.46× and 1.53× speedup and reducing energy consumption by 80.68%, 69.13% and 53.52%, respectively.
- 16 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-23
Open AccessCompressing and Accelerating Sparse CNNs Using Sign-Reserved Toeplitz Filters and Input Activation Density-aware Dataflow
Exploiting the sparsity in convolutional neural networks is crucial to accelerate computing and reduce energy consumption. Unstructured sparsity, benefiting from its flexibility to accommodate arbitrary sparse patterns, generally achieves higher accuracy, but it often introduces irregularity in convolutional operations, which complicates the control logic and undermines the benefits of sparsification. Structured sparsity alleviates these problems but sacrifices its application flexibility, which leads to lower accuracy. In this article, we propose TSCNN, an algorithm-hardware co-design solution that aims to compress and accelerate sparse CNNs while balancing both adaptability to sparsity and computational efficiency. In terms of algorithm, TSCNN adopts pruned filters compressed with sign-reserved Toeplitz matrix format (Tfilters), which systematically enhances the regularity of data reuse and flexibly reduces network parameters by 44%-86% while maintaining accuracy. In terms of hardware, TSCNN accelerator adapts to the structure of Tfilters and utilizes density-aware dataflows to support input activations with large sparsity variation, further optimizing the computational efficiency. Experiments show that TSCNN outperforms a dense CNN accelerator, sparse CNN accelerators SCNN and CSCNN, achieving 5.31× , 2.46× and 1.53× speedup and reducing energy consumption by 80.68%, 69.13% and 53.52%, respectively.
- Open Access
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-26
DFGAS: Exploring the Balance of HW-SW Scheduling through the DFG-Aware Scheme
Coarse-Grained Reconfigurable Architectures (CGRAs) have been regarded as promising spatial computing fabric for the ever-evolving algorithms in multiple domains. However, pure software scheduling cannot compensate for the deficiencies in over-serialization and load imbalancing of these pure static CGRA designs. To address the issues caused by limited hardware flexibility, an in-depth study on the balance between the software and hardware scheduling design of CGRA is needed to achieve more precise, accurate, and adaptive scheduling of dataflow. In this article, we propose DFGAS ( DFG - A ware S cheduling), a dataflow-driven CGRA which provides a comprehensive scheduling approach that encompasses software prediction, runtime adaptive execution, and post-execution refinement. Prior to execution, the TimeStamp prediction algorithm, coupled with the inherent dataflow execution model, enables coarse-grained (block-level) prediction for prioritized transfer and computation on NoC and PEs. During execution, the execution of key dataflow graph (DFG) blocks and edges is accelerated by incorporating a dynamic and adaptive dataflow mechanism. It leverages hardware-software co-design to obtain a holistic view of the entire DFG and continuously self-adaptively optimizes the scheduling process. Furthermore, a complete workflow is implemented, supporting making refinements to the software DFG mapping results. DFGAS represents a scheduling scheme of CGRA that is worth exploring, achieving hardware-software co-design that balances energy efficiency and flexibility. Experiments show that DFGAS achieves 1.35× energy efficiency improvement over a dataflow-driven CGRA and 1.9× energy efficiency improvement over a state-of-the-art pure static CGRA.
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-26
Open AccessDFGAS: Exploring the Balance of HW-SW Scheduling through the DFG-Aware Scheme
Coarse-Grained Reconfigurable Architectures (CGRAs) have been regarded as promising spatial computing fabric for the ever-evolving algorithms in multiple domains. However, pure software scheduling cannot compensate for the deficiencies in over-serialization and load imbalancing of these pure static CGRA designs. To address the issues caused by limited hardware flexibility, an in-depth study on the balance between the software and hardware scheduling design of CGRA is needed to achieve more precise, accurate, and adaptive scheduling of dataflow. In this article, we propose DFGAS ( DFG - A ware S cheduling), a dataflow-driven CGRA which provides a comprehensive scheduling approach that encompasses software prediction, runtime adaptive execution, and post-execution refinement. Prior to execution, the TimeStamp prediction algorithm, coupled with the inherent dataflow execution model, enables coarse-grained (block-level) prediction for prioritized transfer and computation on NoC and PEs. During execution, the execution of key dataflow graph (DFG) blocks and edges is accelerated by incorporating a dynamic and adaptive dataflow mechanism. It leverages hardware-software co-design to obtain a holistic view of the entire DFG and continuously self-adaptively optimizes the scheduling process. Furthermore, a complete workflow is implemented, supporting making refinements to the software DFG mapping results. DFGAS represents a scheduling scheme of CGRA that is worth exploring, achieving hardware-software co-design that balances energy efficiency and flexibility. Experiments show that DFGAS achieves 1.35× energy efficiency improvement over a dataflow-driven CGRA and 1.9× energy efficiency improvement over a state-of-the-art pure static CGRA.