A TSC(torus step coding)adaptive routing algorithm is proposed to solve the area cost and energy dissipation problems caused by using a lot of buffers in NoC(network on chip)design. Virtual channels in torus network are divided into two subnets with increasing or decreasing quantum of 0 and 1 in coding. The nodes in torus network are coded with TSC coding
and the code of one node and the code of any its adjacent node have one and only one bit different. This can reduce network overhead and avoid deadlock on chip. Experimental results show that adaptive packet routings are provided to 94% data packets under uniform transparent network
and that the algorithm can improve adaptability without using more virtual channelgs when network load increases.
关键词
Keywords
references
DALLY W J, SEITZ C L. Deadlock-free message routing in multiprocessor interconnection networks[J]. IEEE Transactions on Computers, 1987, 36(5): 547-553.
GU Huaxi, LIU Zengji, WANG Kun. Distributed adaptive routing algorithms in Torus networks[J]. Journal of Xidian University, 2006, 33(3): 352-358.
ZHANG Min, CHOY C S. Low-cost VC allocation design for virtual channel wormhole routers in networks on chip [C]∥2nd IEEE International Symposium on Networks-on-Chip. Piscataway, NJ, USA: IEEE, 2008: 207-208.
YANG Xiaoqiang, DU Huimin, HAN Jungang. Research on node coding and routing algorithm for network on chip [C]∥ISECS International Colloquium on Computing, Communication, Control, and Management. Los Alamitos, CA, USA: IEEE Computer Society, 2008: 198-203.