Distributed algorithms for shortest-path, deadlock-free routing and broadcasting in arbitrarily faulty hypercubes

Abstract

The authors present a distributed table-filling algorithm for point-to-point routing in a degraded hypercube system. This algorithm finds the shortest length existing path from each source to each destination in the faulty hypercube and fills the routing tables so that messages are routed along these paths. A novel scheme for broadcast routing with tables is proposed, and the algorithm required to fill the broadcast tables, given the point-to-point routing tables, is presented. In addition, the modifications necessary to make these algorithms ensure deadlock-free routing are given. A quantitative and equalitative comparison of previously proposed reroute strategies with table routing, where the tables are filled by the authors' algorithms, are presented.<>