基三分层互连网络及其路由算法设计  

Triplet-based hierarchical interconnection network and design of its routing algorithm

作　　者：乔保军[1] 石峰[2] 计卫星[2] 

机构地区：[1]河南大学数据与知识工程研究所,河南开封475001 [2]北京理工大学计算机科学技术学院,北京100081

出　　处：《计算机工程与设计》2007年第18期4390-4393,共4页Computer Engineering and Design

摘　　要：从降低节点度、减少网络链路数和缩短网络直径的角度出发,提出一种新型的互连网络结构——基三分层互连网络,深入地研究了该网络的静态度量并和2-DMesh做了相应的比较。针对基三分层互连网络提出了一种使消息沿两节点间确定路径传递的分布式确定路由算法DDRA。该算法充分利用基三分层互连网络的层次特性,不需要构建路由表,且算法实现简单,路由效率高,且易于硬件实现。In order to decrease the node degree, reduce the links and shorten the diameter, a new interconnection network, named triplet-based hierarchical interconnection network （THIN）, is presented. The network properties are described and compared with 2-D mesh. Furthermore, DDRA （distributed deterministic routing algorithm） routing algorithm for THIN is proposed. Fully applying the hierarchical characteristic of the network, DDRA routing algorithm just used the node address to determine a deterministic path between source and destination node, without constructing the route table on each node. The analysis based on the simulation of DDRA shows it is not only very simple and easy to be implemented in hardware, but also has high efficiency.

关 键 词：并行计算 基三分层互连网络 网络拓扑 二维网格 路由算法 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]