Topological Properties and Routing Algorithm for the Static K-ary N-tree Interconnection Network
Masahiro Tozaki, Yamin Li · 2017
This paper proposes a static k-ary n-tree interconnection network. Different from the traditional k-ary n-tree network which contains compute nodes only in the leaf nodes at the lowest layer and the rest of layers contains only switches, our network consists of identical nodes that contain both the switches and compute nodes. In other words, the traditional k-ary n-tree is an indirect dynamic network and the static k-ary n-tree is a direct static network.We describe the structure of the static k-ary n-tree, derive its topological properties, give a formal shortestpath routing algorithm, and evaluate the cost/performance of the static k-ary n-tree with the comparisons to other networks.