Triplet-based hierarchical interconnection network and design of its routing algorithm
Weixing Ji · Jisuanji gongcheng yu sheji · 2007
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.