Deadlock-Free Fully Adaptive Routing in 2-Dimensional Tori Based on New Virtual Network Partitioning Scheme

Abstract

A new deadlock-free fully adaptive routing algorithm is proposed for 2-dimensional tori with only two virtual channels. The deadlock avoidance technique is presented based on a new virtual network partitioning scheme. Unlike the previous virtual network partitioning schemes, the new method allows all virtual networks to share some common virtual channels. Two virtual channels should be the lower bound for fully adaptive deadlock-free routing in tori because the dimension order routing for 2-dimensional tori also needs two virtual channels. The proposed virtual network partitioning scheme can avoid all potential deadlocks and provides fully adaptive routing. Enough theoretical analyses on the proposed virtual network partitioning scheme are presented. Sufficient simulation results are presented to demonstrate the effectiveness of the proposed algorithm by comparing with the dimension-order routing, two partially adaptive routing schemes, Duato's protocol and the load-balanced routing algorithm GOAL.