Table-lookup determined routing algorithm for triple-based hierarchical interconnection network
基三分层网络中一种基于查表的确定路由算法

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 interconnection 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.