A Novel Shortest-distance Path-based Multicast Routing Algorithm for Network-on-Chips

This paper proposed a new shortest-distance path-based (SP) multicast routing algorithm, which is suitable for 2D Mesh topology. The algorithm uses a new partitioning method, which reduces data traffic and average latency. By setting different priorities for the data packets of each node, the network traffic is further balanced. Also, we present a novel compression scheme for a multicast head flit, which reduces the original head flit width to 1/3. Experimental results show that the SP routing algorithm proposed is superior to the traditional column path (CP) algorithm in terms of latency and power consumption.