Wormhole routing has been popular in massively parallel computing systems due to its low packet latency. However, it is subject to deadlock, where packets are waiting for resources in a cyclic form indefinitely. Current deadlock detection techniques are basically dependent on the time-out strategy, thus yielding unignorable number of false deadlock detections especially in heavy network loads or with long packets. Moreover, several packets in a deadlock may be marked as deadlocked, which would

more »

... aturate the resources allocated for recovery. This paper proposes a simple but more accurate deadlock detection scheme which is less dependent on the time-out value. The proposed scheme presumes deadlock only when a cyclic dependency among blocked packets exists. Consequently, the suggested scheme considerably reduces the probability of detecting false deadlocks over previous schemes, thus enabling more efficient deadlock recovery and higher network throughput. Simulation results are provided to demonstrate the efficiency of the proposed scheme.