An improved multiple-path deadlock-free routing algorithm in binary hypercubes

Abstract

This paper presents a multiple-path deadlock-free routing algorithm in direct binary hypercubes which is an improved version of a previously published algorithm by the author (1991). Between two nodes of distance k, the previous algorithm provides k disjoint paths in one direction and one path in the other. The direction with one path is a performance bottleneck. The new algorithm adds one more disjoint path to the narrow direction using buffer management technique, and preserves the deadlock-free property. Although only one path is added, simulation results presented in this paper show a significant performance improvement since the added path almost doubles the capacity of the bottleneck.<>