Zhiyuan Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhiyuan Zhang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Zhihua Fan
Institute of Computing Technology Chinese Academy of Sciences
4 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 - Xuejun An
Institute of Computing Technology Chinese Academy of Sciences
3 shared publications - Yuhang Qiu
State Key Lab of Processors, 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
- 19 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (3) , 1-26
GenCNN: A Partition-Aware Multi-Objective Mapping Framework for CNN Accelerators Based on Genetic Algorithm
Convolutional Neural Networks (CNNs) require partitioning to efficiently run on CNN accelerators, which offer multiple parallel processing dimensions, such as Processing Element (PE) array topologies and Single Instruction Multiple Data (SIMD) execution. The choice of parallelization strategy directly impacts accelerator performance. However, the vast search space for CNN partitioning and parallelization makes manual optimization costly and complex, especially when addressing both aspects simultaneously. This highlights the need for an automated framework to efficiently map CNNs onto accelerators. Our key insight is that existing approaches suffer from inadequate accelerator performance modeling and a lack of multi-objective optimization strategies that jointly consider task partitioning and convolution parallelization. To address this, we propose GenCNN, a multi-objective genetic algorithm-based mapping framework for CNN accelerators. GenCNN first constructs a fine-grained performance model that captures both off-chip data access and on-chip data processing. It then applies the Non-dominated Sorting Genetic Algorithm II improved by Multi-Objective Bayesian Optimization to derive a Pareto-optimal partitioning and parallelization strategy that balances off-chip latency and PE utilization. Finally, GenCNN optimizes scheduling and routing to minimize data transfers. Experimental results show that GenCNN achieves up to 17.66× speedup in compilation and 6.47× in execution compared with state-of-the-art mapping frameworks.
- 19 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (3) , 1-26
Open AccessGenCNN: A Partition-Aware Multi-Objective Mapping Framework for CNN Accelerators Based on Genetic Algorithm
Convolutional Neural Networks (CNNs) require partitioning to efficiently run on CNN accelerators, which offer multiple parallel processing dimensions, such as Processing Element (PE) array topologies and Single Instruction Multiple Data (SIMD) execution. The choice of parallelization strategy directly impacts accelerator performance. However, the vast search space for CNN partitioning and parallelization makes manual optimization costly and complex, especially when addressing both aspects simultaneously. This highlights the need for an automated framework to efficiently map CNNs onto accelerators. Our key insight is that existing approaches suffer from inadequate accelerator performance modeling and a lack of multi-objective optimization strategies that jointly consider task partitioning and convolution parallelization. To address this, we propose GenCNN, a multi-objective genetic algorithm-based mapping framework for CNN accelerators. GenCNN first constructs a fine-grained performance model that captures both off-chip data access and on-chip data processing. It then applies the Non-dominated Sorting Genetic Algorithm II improved by Multi-Objective Bayesian Optimization to derive a Pareto-optimal partitioning and parallelization strategy that balances off-chip latency and PE utilization. Finally, GenCNN optimizes scheduling and routing to minimize data transfers. Experimental results show that GenCNN achieves up to 17.66× speedup in compilation and 6.47× in execution compared with state-of-the-art mapping frameworks.
- 9 January 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 159
Accelerating tensor multiplication by exploring hybrid product with hardware and software co-design
- 9 January 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 159
Accelerating tensor multiplication by exploring hybrid product with hardware and software co-design