Abstract:
Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a Group-based Shortest Path Routing algorithm (GSR) for the HCCR. Network properties of HCCR are compared with Spidergon, THIN, 2-D Mesh and Hypercube. It is shown that the proposed topology offers a high degree of regularity, scalability, and symmetry with a reduced number of links, small diameter and low node degree. A unique address encoding scheme is proposed for hierarchical graphical representation of HCCR networks, based on which the GSR was developed. . The proposed addressing scheme divides the HCCR network into logical groups of same as well as different sizes. Packets move towards receiver using local or global routing. Simulations are performed to find all the possible shortest paths with GSR in HCCR networks (up to 1024 nodes). All the shortest paths produced by GSR are verified against Dijkstra?s algorithm. The GSR for k-level HCCR ( ) with ( )nodes, requires ( ) time in the worst case to determine the next node along the shortest path. Average distance and frequency of hop counts of HCCR networks are investigated using GSR. The results are compared with average distance of 2-D Mesh. Experimental results show that with a network size of 1024 nodes, there is only a 7.7% increase in the average distance of HCCR in comparison to 2-D Mesh. However have fewer paths with high hop count in comparison to 2-D Mesh.
