Dynamic routing algorithm for avoiding hot spots in on-chip networks

In this paper, we proposed a routing model for distributing hot spots within on-chip networks. It takes advantage of both adaptive minimal path and non-minimal path algorithms. To evaluate the efficiency of the model, a simulator developed using C++ is employed to compare the methods. The simulation results show that in realistic traffic models, like first transpose traffic, and in dense traffics the proposed algorithm has lower average delays compared to the previously proposed models