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.

[1]  Nikitas J. Dimopoulos,et al.  Advanced General Purpose Multicomputer for Space Applications , 1987, ICPP.

[2]  N.J. Dimopoulos,et al.  Performance evaluation of the backtrack-to-the-origin-and retry routing for hypercycle-based interconnection networks , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[3]  John C. Peterson,et al.  The Mark III Hypercube-Ensemble Concurrent Computer , 1985, International Conference on Parallel Processing.

[4]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[5]  Gunnar E. Carlsson,et al.  Interconnection Networks Based on a Generalization of Cube-Connected Cycles , 1985, IEEE Transactions on Computers.

[6]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[7]  William J. Dally,et al.  The message-driven processor: a multicomputer processing node with efficient mechanisms , 1992, IEEE Micro.

[8]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[9]  E. Chow,et al.  A Real-Time Adaptive Message Routing Network for the Hypercube Computer , 1987, RTSS.

[10]  Dharma P. Agrawal,et al.  Design and Performance of Generalized Interconnection Networks , 1983, IEEE Transactions on Computers.

[11]  Makoto Imase,et al.  Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.

[12]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[13]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[14]  Gert Sabidussi,et al.  Graph multiplication , 1959 .

[15]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[16]  Nikitas J. Dimopoulos,et al.  Routing and processor allocation on a Hypercycle-based multiprocessor , 1991, ICS '91.

[17]  Nikitas J. Dimopoulos,et al.  MAX: Advanced General Purpose Real-Time Multicomputer for Space Applications , 1987, RTSS.

[18]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.