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 <tex-math notation="LaTeX">$%$</tex-math> , improves the throughput by 11.27 <tex-math notation="LaTeX">$%$</tex-math> , reduces the energy by 12.62 <tex-math notation="LaTeX">$%$</tex-math> , and reduces the time-energy-product (TEP) by 14.49 <tex-math notation="LaTeX">$%$</tex-math> . The results also show that the performance enhancement is related to the coefficient of variation of the neural network to be computed.
No takes yet. Share an insight, caveat, or question.
Xue et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: