A General Methodology for Routing in Irregular Networks

Abstract

Irregular networks provide more scalability and better cost-performance for network-based parallel computing systems. There has been much work done on developing routing algorithms for this class of networks. In this paper, a general methodology for generating deadlock-free routing algorithms for irregular networks is proposed. It not only introduces three novel efficient routing algorithms, but also covers the three best-known routing algorithms already proposed for irregular networks in the literature, namely Up/Down, Left/Right, and L-turn routing algorithms. As revealed by simulation results, the performance of the six routing algorithms mainly depends on network topology and different scenarios some of proposed routing algorithms exhibit superior performance.