In the field of high-performance computing, dataflow computation is an important computing architecture and shows good performance and applicability in many practical scenarios. In the dataflow computation mode, the program is represented by a dataflow diagram. A key problem of dataflow computation is how to map dataflow diagrams to multiple execution units. By analyzing the instruction mapping methods of current dataflow architecture and their shortcomings, we propose a new instruction mapping optimization method based on dataflow architecture, and achieve code implementation and verification. We optimize the instruction mapping method according to the characteristics of multi-address shared data packets, delay the splitting of multiaddress shared data packets, and reduce network congestion.

Key words: