Flexible and efficient routing based on progressive deadlock recovery

The development of fully adaptive, cut-through (wormhole) networks is important for achieving high performance in communication-critical parallel processor systems. Increased flexibility in routing allows network bandwidth to be used efficiently, but also creates more opportunity for cyclic resource dependencies to form which can cause deadlock. If not guarded against, deadlocks in routing make packets block in the network indefinitely and, eventually, could result in the entire network coming to a complete standstill. The paper presents a simple, flexible, and efficient routing approach for multicomputer interconnection networks which is based on progressive deadlock recovery as proposed to deadlock avoidance or regressive deadlock recovery. Performance is optimized by allowing the maximum routing freedom provided by network resources to be exploited. True fully adaptive routing is supported in which all physical and virtual channels at each node in the network are available to packets without regard for deadlocks. Deadlock cycles, upon forming, are efficiently broken in finite time by progressively routing one of the blocked packets through a connected, deadlock-free recovery path. This routing approach enables the design of high-throughput networks that provide excellent performance. Simulations indicate that progressive deadlock recovery routing can improve throughput by as much as 45 percent and 25 percent over leading deadlock avoidance-based and regressive recovery-based routing schemes, respectively