Siyue Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Siyue Li has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Li Li
Nanjing University
4 shared publications - Yuxiang Fu
Nanjing University
4 shared publications - Wenjie Fan
School of Electronic Science and Engineering, Nanjing University, Nanjing, Jiangsu, CHINA
3 shared publications Chenyang Dai
School of Integrated Circuits and the School of Electronic Science and Engineering, Nanjing University, Qixia, Nanjing, Jiangsu, China
2 shared publications- Jinlun Ji
School of Integrated Circuits, and School of Electronic Science and Engineering, Nanjing University, Nanjing, Jiangsu, China
2 shared publications - Tong Cheng
School of Electronic Science and Engineering, Nanjing University, Nanjing, Jiangsu, CHINA
2 shared publications
Latest Publications
- 1 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (9) , 4710-4722
FAS-NoC: A Real-Time Fused Approximation Scheme Coordinating Communication and Computation for NoC-Based NN Accelerators
Network-on-Chip (NoC) is a scalable on-chip communication architecture widely used in neural network accelerators. However, data-intensive applications like machine learning place significant demands on the NoC’s communication and computation, and often have a degree of resilience to data noise, which allows to use approximation techniques to reduce execution time and energy consumption for both computation and communication, under the constraints of acceptable quality loss. Traditional approximate NoCs do not consider the data distribution characteristics of the neural networks, resulting in a lower approximate rate. Moreover, these schemes do not take the synergistic optimization of computation and communication, which limits reductions in execution time. In this paper, we propose a Fused Approximation Scheme of NoC (FAS-NoC) that incorporates the characteristics of data distribution in neural networks. FAS-NoC includes an approximate compression and recovery scheme based on data hierarchy, and uses a congestion-aware scheme to adjust the approximate rate of the node. Additionally, by leveraging the characteristics of recovered data after approximate communication, the scheme optimizes the design of computing units within the computing array. FAS-NoC collaboratively optimizes approximate communication and computation, organically integrating the two aspects. Compared with the state-of-the-art approximate framework ACDC (ACDC_ABDTR and ACDC_APPROX), the execution time of FAS-NoC is reduced by 48.94% and 47.72%, respectively. The experimental results show that the additional area overhead of the FAS-NoC only accounts for 0.81% of the original node, the additional power consumption overhead only accounts for 0.75% of the original node.
- 1 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (9) , 4710-4722
FAS-NoC: A Real-Time Fused Approximation Scheme Coordinating Communication and Computation for NoC-Based NN Accelerators
Network-on-Chip (NoC) is a scalable on-chip communication architecture widely used in neural network accelerators. However, data-intensive applications like machine learning place significant demands on the NoC’s communication and computation, and often have a degree of resilience to data noise, which allows to use approximation techniques to reduce execution time and energy consumption for both computation and communication, under the constraints of acceptable quality loss. Traditional approximate NoCs do not consider the data distribution characteristics of the neural networks, resulting in a lower approximate rate. Moreover, these schemes do not take the synergistic optimization of computation and communication, which limits reductions in execution time. In this paper, we propose a Fused Approximation Scheme of NoC (FAS-NoC) that incorporates the characteristics of data distribution in neural networks. FAS-NoC includes an approximate compression and recovery scheme based on data hierarchy, and uses a congestion-aware scheme to adjust the approximate rate of the node. Additionally, by leveraging the characteristics of recovered data after approximate communication, the scheme optimizes the design of computing units within the computing array. FAS-NoC collaboratively optimizes approximate communication and computation, organically integrating the two aspects. Compared with the state-of-the-art approximate framework ACDC (ACDC_ABDTR and ACDC_APPROX), the execution time of FAS-NoC is reduced by 48.94% and 47.72%, respectively. The experimental results show that the additional area overhead of the FAS-NoC only accounts for 0.81% of the original node, the additional power consumption overhead only accounts for 0.75% of the original node.
- 12 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (12) , 2882-2896
Automatic Generation and Optimization Framework of NoC-Based Neural Network Accelerator Through Reinforcement Learning
Choices of dataflows, which are known as intra-core neural network (NN) computation loop nest scheduling and inter-core hardware mapping strategies, play a critical role in the performance and energy efficiency of NoC-based neural network accelerators. Confronted with an enormous dataflow exploration space, this paper proposes an automatic framework for generating and optimizing the full-layer-mappings based on two reinforcement learning algorithms including A2C and PPO. Combining soft and hard constraints, this work transforms the mapping configuration into a sequential decision problem and aims to explore the performance and energy efficient hardware mapping for NoC systems. We evaluate the performance of the proposed framework on 10 experimental neural networks. The results show that compared with the direct-X mapping, the direct-Y mapping, GA-base mapping, and NN-aware mapping, our optimization framework reduces the average execution time of 10 experimental NNs by 9.09%, improves the throughput by 11.27%, reduces the energy by 12.62%, and reduces the time-energy-product (TEP) by 14.49%. The results also show that the performance enhancement is related to the coefficient of variation of the neural network to be computed.
- 12 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (12) , 2882-2896
Automatic Generation and Optimization Framework of NoC-Based Neural Network Accelerator Through Reinforcement Learning
Choices of dataflows, which are known as intra-core neural network (NN) computation loop nest scheduling and inter-core hardware mapping strategies, play a critical role in the performance and energy efficiency of NoC-based neural network accelerators. Confronted with an enormous dataflow exploration space, this paper proposes an automatic framework for generating and optimizing the full-layer-mappings based on two reinforcement learning algorithms including A2C and PPO. Combining soft and hard constraints, this work transforms the mapping configuration into a sequential decision problem and aims to explore the performance and energy efficient hardware mapping for NoC systems. We evaluate the performance of the proposed framework on 10 experimental neural networks. The results show that compared with the direct-X mapping, the direct-Y mapping, GA-base mapping, and NN-aware mapping, our optimization framework reduces the average execution time of 10 experimental NNs by 9.09%, improves the throughput by 11.27%, reduces the energy by 12.62%, and reduces the time-energy-product (TEP) by 14.49%. The results also show that the performance enhancement is related to the coefficient of variation of the neural network to be computed.
- 30 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (10) , 4521-4525
Communication Synchronization-Aware Arbitration Policy in NoC-Based DNN Accelerators
In NoC-based neural network accelerators, many-to-one and many-to-many are prevalent traffic patterns. In these traffic patterns, there exists a need for communication synchronization between Processing Elements (PEs) of adjacent layers to optimize latency. The last received packet will determine the end time of a layer’s computation. The Communication Synchronization-aware Arbitration Policy (CSAP) is proposed in this paper to handle this problem, which uses a negative feedback mechanism to regulate the packet sending rate of each source node. Compared with the local-age-based policy, CSAP decreases the execution by 4.69% ~ 12.55% across neural networks of different scales. The proposed policy only incurs 1.06% additional hardware overhead in the router compared with the local-age-based policy.
- 30 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (10) , 4521-4525
Communication Synchronization-Aware Arbitration Policy in NoC-Based DNN Accelerators
In NoC-based neural network accelerators, many-to-one and many-to-many are prevalent traffic patterns. In these traffic patterns, there exists a need for communication synchronization between Processing Elements (PEs) of adjacent layers to optimize latency. The last received packet will determine the end time of a layer’s computation. The Communication Synchronization-aware Arbitration Policy (CSAP) is proposed in this paper to handle this problem, which uses a negative feedback mechanism to regulate the packet sending rate of each source node. Compared with the local-age-based policy, CSAP decreases the execution by 4.69% ~ 12.55% across neural networks of different scales. The proposed policy only incurs 1.06% additional hardware overhead in the router compared with the local-age-based policy.
- 12 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (4) , 1863-1875
HAS-RL: A Hierarchical Approximate Scheme Optimized With Reinforcement Learning for NoC-Based NN Accelerators
Network-on-Chip (NoC) is a scalable on-chip communication architecture for the NN accelerator, but with the increase in the number of nodes, the communication delay becomes higher. Applications such as machine learning have a certain resilience to noisy/erroneous transmitted data. Therefore, approximate communication becomes a promising solution to improving performance by reducing traffic loads under the constraint of the acceptable maximum accuracy loss of neural networks. It is a key issue to balance the result quality and the communication delay for approximate NoC systems. The traditional approximate NoC only considers the node-to-node approximation-based dynamic traffic regulation. However, the dynamically changing traffic patterns across different nodes, different times, and different applications lead to a huge search space, which makes it hard to explore an optimal global approximation solution. In this paper, we propose a quality model for different neural networks, which presents the relationship between the quality loss and the data approximate rate. Then, a hierarchical approximate scheme optimized with reinforcement learning (HAS-RL) is proposed and we reduce the complexity of the HAS-RL by reducing the state space and action space, which will reduce the resource overhead as well. After that, we embed a global approximate controller in the NoC system, in which we deploy a policy network trained with the offline reinforcement learning algorithm to adjust the data approximate rates of each node at run time. Compared with the state-of-the-art method, the proposed scheme reduces the average network delay by 13.5% while their accuracies are similar. The proposed HAS-RL only causes an additional area overhead of 1.24% and power consumption of 0.77% compared with the traditional router design.
- 12 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (4) , 1863-1875
HAS-RL: A Hierarchical Approximate Scheme Optimized With Reinforcement Learning for NoC-Based NN Accelerators
Network-on-Chip (NoC) is a scalable on-chip communication architecture for the NN accelerator, but with the increase in the number of nodes, the communication delay becomes higher. Applications such as machine learning have a certain resilience to noisy/erroneous transmitted data. Therefore, approximate communication becomes a promising solution to improving performance by reducing traffic loads under the constraint of the acceptable maximum accuracy loss of neural networks. It is a key issue to balance the result quality and the communication delay for approximate NoC systems. The traditional approximate NoC only considers the node-to-node approximation-based dynamic traffic regulation. However, the dynamically changing traffic patterns across different nodes, different times, and different applications lead to a huge search space, which makes it hard to explore an optimal global approximation solution. In this paper, we propose a quality model for different neural networks, which presents the relationship between the quality loss and the data approximate rate. Then, a hierarchical approximate scheme optimized with reinforcement learning (HAS-RL) is proposed and we reduce the complexity of the HAS-RL by reducing the state space and action space, which will reduce the resource overhead as well. After that, we embed a global approximate controller in the NoC system, in which we deploy a policy network trained with the offline reinforcement learning algorithm to adjust the data approximate rates of each node at run time. Compared with the state-of-the-art method, the proposed scheme reduces the average network delay by 13.5% while their accuracies are similar. The proposed HAS-RL only causes an additional area overhead of 1.24% and power consumption of 0.77% compared with the traditional router design.