Advanced Search
Wang Yong, Zhang Jianxian, Zhou Duan. Routing Algorithm of Network on Chip Guided by Straight Line[J]. Journal of Computer-Aided Design & Computer Graphics, 2016, 28(5): 830-835.
Citation: Wang Yong, Zhang Jianxian, Zhou Duan. Routing Algorithm of Network on Chip Guided by Straight Line[J]. Journal of Computer-Aided Design & Computer Graphics, 2016, 28(5): 830-835.

Routing Algorithm of Network on Chip Guided by Straight Line

  • A novel routing Algorithm, namely Beeline routing, is proposed to improve the routing communication efficiency and reduce energy consumption for No Cs. This algorithm selects the straight line formed by the source and the destination of packets as the guide direction. It calculates the distance between the straight line and the other three nodes which are located in the same grid as the current router node, so that the nearest routing node from the straight line is obtained, and the hops between the current router node and the nearest router node are calculated. The best transmission routing node is selected according to the congestion status of neighboring routing node and the number of hops. At last, the algorithm and the network-on-chip energy consumption simulation platform based on architecture level model are combined. The experimental results show that Beeline routing can achieve better routing performance, comparing with XY and OE routing Algorithm, and the average power consumption decreased by about 6%.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return