Topological Properties and Routing Algorithm Considering Deadlock of the Static k-ary n-tree Interconnection Network

This paper proposes a static k-ary n-tree interconnection network. This network is based on traditional k-ary n-tree 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. Our network has a better diameter than other networks. However, in our network, the shortest-path routing algorithm may cause deadlocks. In this paper, we describe the structure of the static k-ary n-tree, derive its topological properties. We also give a formal shortest-path routing algorithm and a routing algorithm considering deadlock. Finally, we evaluate the cost/performance of the static k-ary n-tree with the comparisons to other networks