This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network
January 1993 (vol. 4 no. 1)
pp. 111-117

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

[1] B. W. Arden and H. Lee, "A regular network for multicomputer systems,"IEEE Trans. Comput., vol. 31, no. 1, pp. 60-69, Jan 1982.
[2] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[3] N. G. De Bruijn, "A combinatorial problem,"Koninklijke Netherlands: Academe Van Wetenschappen, Proc., vol. 49, no. 20, pp. 758-764, 1946.
[4] M. Debbage, M. Hill, and D. Nicole,Virtual Channel Router Version 2.0 User Guide, Dep. of Electron. and Comput. Sci., Univ. of Southampton, U.K., June 1991.
[5] D. Gelernter, "A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks,"IEEE Trans. Comput., vol. 30, no. 10, pp. 709-715, Oct 1981.
[6] I. Grossman and W. Magnus,Groups and their Graphs. New York: Random House, New Mathematical Library, 1964.
[7] K. D. Gunther, "Prevention of deadlocks in packet-switched data transport systems,"IEEE Trans. Commun., vol. COM-29, no. 4, pp. 512-524, Apr. 1981.
[8] INMOS Ltd.Transputer Reference Manual. Englewood Cliffs, NJ: Prentice-Hall, 1988.
[9] C. R. Jesshope, P. R. Miller, and J. T. Yantchev, "High performance communication in processor networks," inProc. 16th Annu. Int. Symp. Comput. Architecture, pp. 150-157, May 1989.
[10] V. P. Kumar and S. M. Reddy, "A class of graphs for fault-tolerant processor interconnections," inProc. 4th Int. Conf. Distributed Comput. Syst., San Francisco, CA, May 1984, pp. 448-460.
[11] C. R. Lang, "The extension of object-oriented languages to a homogeneous concurrent architecture," Ph.D. dissertation, California Instit. Technol., 5014:TR:82, 1982.
[12] P. M. Merlin and P. J. Schweitzer, "Deadlock avoidance in store-and-forward networks--I: Store-and-forward deadlock,"IEEE Trans. Commun., vol. COM-28, pp. 345-354, Mar. 1980.
[13] F. P. Preparata and J. E. Vuillemin, "The cube-connected cycles: A versatile network for parallel computation," inProc. 20th IEEE Symp. Foundations Comput. Sci., pp. 140-147.
[14] M. R. Samatham and D. K. Pradhan, "The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI,"IEEE Trans. Comput., vol. 38, no. 4, pp. 567-581, Apr. 1989.
[15] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. 30, no. 2, pp. 153-161, Feb. 1971.
[16] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105-117.
[17] S. Toueg and J. D. Ullman, "Deadlock-free packet switching networks," inProc. 11th ACM Symp. Theory Comput., May 1979, pp. 89-98.
[18] J. van Leeuwen and R. B. Tan, "Interval routing,"Comput. J., vol. 30, pp. 298-307, Aug. 1987.

Index Terms:
Index Termsnetwork diameter; interval routing; deadlock-free fixed degree network; multiprocessorinterconnection network; cube-connected Mobius ladders; deadlock-free routingstrategy; fixed node degree; Cayley graph; fixed degree topology of size; transputernetworks; computational complexity; graph theory; multiprocessor interconnectionnetworks; parallel algorithms; topology
Citation:
D.J. Pritchard, D.A. Nicole, "Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 1, pp. 111-117, Jan. 1993, doi:10.1109/71.205658
Usage of this product signifies your acceptance of the Terms of Use.