Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network

The authors introduce a multiprocessor interconnection network, known as cube-connected Mobius ladders, which has an inherently deadlock-free routing strategy and hence has none of the buffering and computational overhead required by deadlock-avoidance message passing algorithms. The basic network has a diameter phi of 4n-1 for n2/sup n+2 /nodes and has a fixed node degree of 4. The network can be interval routed in two stages and can be represented as a Cayley graph. This is the only practical fixed degree topology of size O(2/sup phi /) which has an inherently deadlock-free routing strategy, making it ideally suited for medium and large sized transputer networks. >

[1]  C. R. Jesshope,et al.  High performance communications in processor networks , 1989, ISCA '89.

[2]  Wilhelm Magnus,et al.  Groups and Their Graphs: Contents , 1992 .

[3]  Jeffrey D. Ullman,et al.  Deadlock-free packet switching networks , 1979, SIAM J. Comput..

[4]  Corporate Inmos Limited.  Transputer Reference Manual , 1988 .

[5]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[6]  P. Merlin,et al.  Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock , 1980, IEEE Transactions on Communications.

[7]  Jan van Leeuwen,et al.  Interval Routing , 1987, Computer/law journal.

[8]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[9]  K. Gunther,et al.  Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .

[10]  Sudhakar M. Reddy,et al.  A Class of Graphs for Fault-Tolerant Processor Interconnections , 1984, ICDCS.

[11]  Bruce W. Arden,et al.  A Regular Network for Multicomputer Systems , 1982, IEEE Transactions on Computers.

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

[13]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[14]  Jr. Charles Richard Lang.  The extension of object-oriented languages to a homogeneous, concurrent architecture , 1982 .

[15]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[16]  Theodore R. Bashkow,et al.  A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.

[17]  DAVID GELERNTER.  A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks , 1981, IEEE Transactions on Computers.