
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D.J. Pritchard, D.A. Nicole, "Cube Connected Mobius Ladders: An Inherently DeadlockFree Fixed Degree Network," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 1, pp. 111117, January, 1993.  
BibTex  x  
@article{ 10.1109/71.205658, author = {D.J. Pritchard and D.A. Nicole}, title = {Cube Connected Mobius Ladders: An Inherently DeadlockFree Fixed Degree Network}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {1}, issn = {10459219}, year = {1993}, pages = {111117}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.205658}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Cube Connected Mobius Ladders: An Inherently DeadlockFree Fixed Degree Network IS  1 SN  10459219 SP111 EP117 EPD  111117 A1  D.J. Pritchard, A1  D.A. Nicole, PY  1993 KW  Index Termsnetwork diameter; interval routing; deadlockfree fixed degree network; multiprocessorinterconnection network; cubeconnected Mobius ladders; deadlockfree routingstrategy; fixed node degree; Cayley graph; fixed degree topology of size; transputernetworks; computational complexity; graph theory; multiprocessor interconnectionnetworks; parallel algorithms; topology VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
The authors introduce a multiprocessor interconnection network, known ascubeconnected Mobius ladders, which has an inherently deadlockfree routing strategyand hence has none of the buffering and computational overhead required bydeadlockavoidance message passing algorithms. The basic network has a diameter phi of4n1 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 inherentlydeadlockfree 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. 6069, Jan 1982.
[2] W.J. Dally and C.L. Seitz, "DeadlockFree Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[3] N. G. De Bruijn, "A combinatorial problem,"Koninklijke Netherlands: Academe Van Wetenschappen, Proc., vol. 49, no. 20, pp. 758764, 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 DAGbased algorithm for prevention of storeandforward deadlock in packet networks,"IEEE Trans. Comput., vol. 30, no. 10, pp. 709715, 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 packetswitched data transport systems,"IEEE Trans. Commun., vol. COM29, no. 4, pp. 512524, Apr. 1981.
[8] INMOS Ltd.Transputer Reference Manual. Englewood Cliffs, NJ: PrenticeHall, 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. 150157, May 1989.
[10] V. P. Kumar and S. M. Reddy, "A class of graphs for faulttolerant processor interconnections," inProc. 4th Int. Conf. Distributed Comput. Syst., San Francisco, CA, May 1984, pp. 448460.
[11] C. R. Lang, "The extension of objectoriented 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 storeandforward networksI: Storeandforward deadlock,"IEEE Trans. Commun., vol. COM28, pp. 345354, Mar. 1980.
[13] F. P. Preparata and J. E. Vuillemin, "The cubeconnected cycles: A versatile network for parallel computation," inProc. 20th IEEE Symp. Foundations Comput. Sci., pp. 140147.
[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. 567581, Apr. 1989.
[15] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. 30, no. 2, pp. 153161, 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. 105117.
[17] S. Toueg and J. D. Ullman, "Deadlockfree packet switching networks," inProc. 11th ACM Symp. Theory Comput., May 1979, pp. 8998.
[18] J. van Leeuwen and R. B. Tan, "Interval routing,"Comput. J., vol. 30, pp. 298307, Aug. 1987.