Research On Highly Adaptive Routing Algorithm Based On NOC Load Balancing

In recent years,with the rapid development of integrated circuit semiconductor technology,it has become one of the increasingly concerned industries at home and abroad.Network onChip(NoC)is proposed to replace bus-based system on chip(SoC).As a communication subset of SoC,one of the advantages of NoC is that it can integrate a large number of IP cores on a single chip,so NoC has attracted wide attention from all walks of life since it was put forward.NoC system mainly includes topology,routing method,switching mechanism,load balancing,deadlock problem,performance evaluation and virtual channel.The research focus of this paper is routing algorithm.In routing algorithm,the network performance of the algorithm is mainly judged by the average delay and throughput of the network.Routing algorithms can be divided into deterministic routing and adaptive routing according to routing methods: deterministic routing is favored by scholars because of its single routing path and simple algorithm,but its network performance is seriously degraded under the condition of large and complex network traffic;Adaptive routing allows multiple routing paths to exist,which effectively improves the performance of routing algorithms.Therefore,this paper chooses the adaptive routing algorithm to study.In this paper,several traditional routing algorithms are introduced,and the advantages and disadvantages of each routing algorithm are summarized by analyzing and comparing the simulation results.For example,XY routing algorithm can maintain good performance under the condition of uniform network traffic,but under the condition of huge and complex network traffic,network congestion is easy to occur and network utilization is low;Westward First(WF)routing algorithm and Eastward Last(EL)routing algorithm can better solve the problem of network congestion in deterministic routing,but the self-adaptability is extremely uneven in all directions.Double-y routing algorithm,which introduces virtual channel technology,allocates one virtual channel and two virtual channels on X-dimensional and Y-dimensional transmission channels respectively,which prohibits excessive routing turns and achieves complete self-adaptation of routing paths,but it has many routing restrictions and reduces the overall performance of the network.By analyzing and comparing various routing algorithms,this paper proposes a new efficient routing algorithm-Minimum Routing Restriction Adaptive Routing Algorithm Design(MRA).The routing algorithm adds a virtual channel to the routing channel,and combines WF routing algorithm and EL routing algorithm,so that the adaptive distribution can be balanced in all directions,while maintaining high network performance.Because there are many restrictions on virtual channel path selection in MRA routing algorithm,and the network performance is not obviously improved in partial traffic mode,this paper proposes a difference probability method,which obtains an optimal probability through a large number of simulation experiments,and then allocates routing paths to obtain IMRA routing algorithm,which has improved the network performance compared with MRA algorithm.