A Generalized Theory Based on the Turn Model for Deadlock-Free Irregular Networks

Ryuta KAWANO, Ryota YASUDO, Hiroki MATSUTANI, Michihiro KOIBUCHI, Hideharu AMANO
2020 IEICE transactions on information and systems  
Recently proposed irregular networks can reduce the latency for both on-chip and off-chip systems with a large number of computing nodes and thus can improve the performance of parallel applications. However, these networks usually suffer from deadlocks in routing packets when using a naive minimal path routing algorithm. To solve this problem, we focus attention on a lately proposed theory that generalizes the turn model to maintain the network performance with deadlock-freedom. The theorems
more » ... main a challenge of applying themselves to arbitrary topologies including fully irregular networks. In this paper, we advance the theorems to completely general ones. Moreover, we provide a feasible implementation of a deadlock-free routing method based on our advanced theorem. Experimental results show that the routing method based on our proposed theorem can improve the network throughput by up to 138 % compared to a conventional deterministic minimal routing method. Moreover, when utilized as the escape path in Duato's protocol, it can improve the throughput by up to 26.3 % compared with the conventional up*/down* routing. key words: interconnection networks, deadlock-free routing algorithm, high performance computing, irregular networks, virtual channels * The name HiRy is derived from the first two letters of the last author's first name and those of the first (or the second) author's.
doi:10.1587/transinf.2018edp7367 fatcat:7wvezuivkve75i3iu4fh2bdsdu