On a novel turn-model based deadlock-free routing algorithm for two-dimensional DMesh networks
Wang Xin-y · Journal of Shenyang Normal University · 2014
Routing algorithm plays an important role in performance of interconnection networks.The 2D DMesh network combines the advantages of both Mesh network and high-radix routers,which lowers down the diameter and average hops in the whole network,as well as providing many more optional paths for messages.In DMesh,this paper presents a novel adaptive deadlock-free routing algorithm based on turn model,which provides much more flexibility for message routing in the network.When the load rate is high,the proposed routing algorithm could efficiently guide messages to avoid the congested area and hotspot routers,which directly translates to lower waiting time,and ultimately cuts down the average latency of the whole network.This paper analyzes the routing diversity of the proposed algorithm, and gives also the formal proof for the aspect of deadlock freedom.Compared with the original DXY routing algorithm, the simulation results show that the proposed algorithm could perfectly cut down average latency,improve transmitting flexibility,and enhance the communicating performance of the whole network.