TITLE:   Routing in Hypercycles. Deadlock Free and Backtracking 
         Strategies

AUTHORS: N. J. Dimopoulos, M. Chowdhury, R. Sivakumar
         and V. Dimakopoulos

IN:      Proceedings PARLE '92, 4th International Parallel
         Architectures and Languages Europe Conference, Paris, 
         France, June 1992, pp. 973 - 974

ABSTRACT

Hypercycles, is a class of multidimensional graphs, which are
generalizations of the n-cube. They are obtained by allowing
each dimension to incorporate more than two elements and a cyclic
interconnection strategy. Hypercycles, can be used in the design
of interconnection networks for distributed systems tailored
specifically to the topology of a particular application. Routing
strategies, including deadlock-free and deadlock-avoiding have
been developed and their relative performance established through
simulations.