TITLE:   Deadlock Preventing Routing in Hypercycles

AUTHORS: N. J. Dimopoulos and R. Sivakumar

IN:      Canadian Journal of Electrical and Computer Engineering
	 No. 4, vol. 19, Oct. 1994, pp. 193-199.

ABSTRACT

Hypercycles is 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 chose among a number 
of alternative size graphs. 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.