Deadlock-free adaptive routing algorithms for the 3D-Torus: Limitations and solutions

Abstract

In this paper, a deadlock-free adaptive routing algorithm, obtained from the application of the theory proposed in [4] to the 3D-torus, is evaluated under different load conditions and compared with other algorithms. The results show that this algorithm is very fast, also increasing the network throughput considerably. Nevertheless, this adaptive algorithm has cycles in its channel dependency graph. As a consequence, when the network is heavily loaded messages may temporarily block cyclically, drastically reducing the performance of the algorithm. Two mechanisms axe proposed to avoid this problem.