Routing in Bidirectional k-ary n-cubes with the Red Rover Algorithm

The Red Rover algorithm previously presented for deadlock-free routing in rings is applied to bidirectional k-ary n-cube multicomputer networks in this work. This algorithm provides greater throughput and lower message latencies than alternative algorithms in most cases. The increased performance offered by this algorithm for wormhole-routed networks is quantified through simulation experiments. Additionally, a routing element which implements this algorithm is shown to be simpler and faster than those of other algorithms by using a well-known timing model. Keywords: Interconnection networks, k-ary n- cubes, wormhole switching 1 Introduction Wormhole routing [10] is a pipelined, circuitswitching mechanism that is being used in several multicomputers such as the Intel TeraFLOPS machine [6], the IBM SP1/2 systems [4], and the Cray T3D/E systems [12]. It is particularly popular because it has a simple hardware implementation that can provide low-latency communication. Unfortunately, wor..