Deadlock-preventing routing in hypercycles

Hypercycles make up a class of multidimensional graphs obtained by allowing each dimension to incorporate more than two elements and a cyclic interconnection. Hypercycles offer simple routing and the ability, given a fixed degree, to choose among a number of graphs of varying size. These graphs can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. We present and prove a deadlock-preventing routing strategy for a subset of hypercycles, and a VLSI hypercycle router component which implements the deadlock-preventing routing.