基三分层网络中一种基于查表的确定路由算法  

Table-lookup determined routing algorithm for triple-based hierarchical interconnection network

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

机构地区：[1]北京理工大学计算机科学工程系

出　　处：《计算机应用》2006年第9期2162-2165,共4页journal of Computer Applications

摘　　要：路由算法对互连网络的通信性能和并行系统性能的发挥起着重要作用。针对基三分层互连网络,提出一种基于查表的使消息沿两节点间近似最短路径传递的分布式确定路由算法TDRA。该算法充分利用基三分层互连网络的层次特性,其路由表中仅保存各节点的同族节点和部分组的路由信息,路由表所占存储空间小,路由效率高。Efficient routing algorithm is very essential to the performance of the interconnection network and the whole parallel computing system. This paper presented TDRA （Table-lookup Deterministic Routing Algorithm） in triple-based hierarchical intercormection network, which always delivers the message along the approximately shortest path between any two nodes. Because the route table of any nodes only stores the route information for its cognation nodes and some special group, the cost of storage is very low and the route performance is high. Finally, the analysis based on the simulation of TDRA shows it is not only very simple and easy to implement, but also highly effective.

关 键 词：并行计算 互连网络 分布式确定路由算法 

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