Energy-efficient Segmented Routing Algorithm For NoC

The rapid development of integrated transistors technology on chip system makes the traditional bus architecture structure low throughput and big time delay. Under the influence of computer network technology, Network-on-chip references the network concept,implements the process units and router units separation and replaces the system on chip and becomes a hot topic of research on complicated chips. The Network-on-chip with two-dimensional architecture becomes one of the main research platforms for its good rules and scalability. The interconnection structure and routing algorithm determines the performance and energy consumption of the network system. With the problem of energy efficient routing mechanism,this thesis proposes a segmented routing algorithm,based on this introduce an Energy-efficient virtual channel allocation mechanism which can avoid deadlock and congestion, at the same time improve the network throughput and reduce the energy consumption.At first, in order to realize the Network-on-chip without deadlock and load balancing,based on XY routing algorithm, this thesis proposes the SRU segmented routing algorithm which selects intermediate node dynamicly. According to the location relationship of the source node, destination node and their manhattan distance it chooses the appropriate intermediate node, and then adopts the XY+YX segmented routing mode, which is good to balance the network traffic. The routing calculation is simple and without need of routing table which helps to save energy. Then with the possibility of deadlock occure in the SRU, the DAMQ and ViChaR mechanism have shortcomings such as complicated designation, low throughput and HoL blocking, the AD VC virtual channel allocation mechanism is presented which can resolve deadlocks. With the adopting of the pre-routing mechanism, each virtual channel maps output port dynamically. AD VC mechansm adjusts the number of virtual channels based on the network traffic, uses a few of buffer slots to achive higner throughput and lows the arbitration cost of the virtual channle to achieve Energy-efficient.The performance of SRU routing algorithm and ADVC virtual channel allocation mechanism are evaluated in this thesis with a self-designed NoC simulator under three traffic patterns with random, permutation and hotspot patterns. In these traffic patterns, the simulation results indicates the average delay of the SRU is lower than DyXY and the throughput of SRU is higher than DyXY. The throughput rate of ADVC is also higher than SVC and ViChaR under permutation and hotspot patterns, improve the communication performance and Energy-efficient.