论文部分内容阅读
从降低节点度、减少网络链路数和缩短网络直径的角度出发,提出一种用于片上核间互连的新型互连网络——基三分层互连网络(THIN),该网络具有明显的层次性、对称性和可扩展性.深入研究了THIN的静态特性,并与2-D Mesh和Hypercube进行对比,结果表明:在网络规模不大时,THIN更适于用来构建片上核间的通信网络.THIN中节点采用一种支持分组的编码方案,基于该方案,设计了一种基于树的受限组播路由算法(TRMA),该算法设计简单、路由效率高并易于硬件实现.仿真结果表明:TRMA比基于单播的多播路由算法具有更小的网络延迟和更少的网络流量.
From the viewpoint of reducing the node degree, reducing the number of network links and shortening the network diameter, a novel interconnection network called THIN for inter-chip core interconnection is proposed, which has obvious The symmetry and scalability of THIN.It studies the static characteristics of THIN in detail and compares it with 2-D Mesh and Hypercube.The results show that THIN is more suitable for constructing the inter-chip space Based on this scheme, a node-based constrained multicast routing algorithm (TRMA) is designed, which is simple in design, high in routing efficiency and easy to implement in hardware. Simulation results show that TRMA has less network delay and less network traffic than unicast-based multicast routing algorithms.