
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
E. Ganesan, D.K. Pradhan, "The HyperdeBruijn Networks: Scalable Versatile Architecture," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 9, pp. 962978, September, 1993.  
BibTex  x  
@article{ 10.1109/71.243525, author = {E. Ganesan and D.K. Pradhan}, title = {The HyperdeBruijn Networks: Scalable Versatile Architecture}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {9}, issn = {10459219}, year = {1993}, pages = {962978}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.243525}, 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  The HyperdeBruijn Networks: Scalable Versatile Architecture IS  9 SN  10459219 SP962 EP978 EPD  962978 A1  E. Ganesan, A1  D.K. Pradhan, PY  1993 KW  Index TermshyperdeBruijn networks; scalable versatile architecture; faulttolerance; VLSI layout;decomposability; multiprocessor networks; logarithmic diameter; optimal connectivity;routing algorithms; multidimensional meshes; complete binary trees; optimal onetoallbroadcasting; fault tolerant computing; hypercube networks; parallel architectures VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Both Hypercube and deBruijn networks possess desirable properties. It should beunderstood, though, that some of the attractive features of one are not found in theother. The architecture proposed in this paper is a combination of these architectures,providing some of the desirable properties of both the networks such as admitting manycomputationally important networks, flexibility in terms of connections per node as well as level of faulttolerance. Also the network allows a simple VLSI layout, scalability as well as decomposability. Thus, these networks can be a potential candidate for VLSI multiprocessor networks. The proposed network possesses logarithmic diameter, optimalconnectivity, and simple routing algorithms amendable to networks with faults.Importantly, in addition to being pancyclic, these hyperdeBruijn networks admit mostcomputationally important subnetworks including rings, multidimensional meshes, complete binary trees, and mesh of trees with perfect dilation. Techniques for optimal onetoall (OTA) broadcasting in these networks are presented. As an intermediate result, this technique provides the fastest OTA broadcasting in binary deBruijn networks as well. The recent renewed interest in binary deBruijn networks makes this later result valuable.
[1] J. R. Armstrong and F. G. Gray, "Fault diagnosis in boolean ncube array of microprocessors,"IEEE Trans. Comput., pp. 590596, June 1981.
[2] J. C. Bermondet al., "Large faulttolerant interconnection networks,"Graphs and Combinatorics, vol. 5, pp. 107123, 1989.
[3] J. C. Bermond and P. Faigniaud, "Broadcasting and gossiping in deBruijn networks," Tech. Rep. 9104, Laboratoire de l'Informatique du Parallelisme, Mar. 1991.
[4] J. C. Bermond and G. Peyrat, "deBruijn and Kautz networks: A competitor for the hypercube?," inHypercube and Distributed Computers, F. Andre and J. P. Verjus, Eds., Institut National de Recherche en Informatique et en Automatique, Elsevier Science Publisher B. V. (NorthHolland), 1989, Oct. 1989, pp. 279293.
[5] S. N. Bhatt and I. Ipson, "Embedding trees in the hypercube," Tech. Rep. RR443, Yale Univ. Research Report, 1985.
[6] S. N. Bhatt and F. T. Leighton, "A framework for solving VLSI graph layout problems,"J. Comput. Syst. Sci., no. 28, pp. 300343, 1984.
[7] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C33, pp. 323333, Apr. 1989.
[8] L. Bomans and D. Roose, "Benchmarking the iPSC/2 hypercube multiprocessor,"Concurrency: Practice and Experience, vol. 1, pp. 318, Sept. 1989.
[9] O. Collinset al., "A VLSI decomposition of the deBruijn graph,"J. ACM, vol. 39, pp. 931948, Oct. 1992.
[10] N. G. deBruijn, "A combinatorial problem,"Koninklijke Netherlands: Academe Van Wetenschappen, vol. 49, no. 20, pp. 758764, 1946.
[11] E. Ganesan and D. K. Pradhan, "HyperdeBruijn multiprocessor networks," Tech. Rep. TR92CSE10, Dep. ECE, Univ. of Massachusetts, Amherst, Mar. 1992.
[12] E. Ganesan, "Interconnection networks and operational techniques for multiprocessor systems," Ph.D. dissertation, Dep. ECE, Univ. of Massachusetts, Amherst, MA 01003, to be submitted.
[13] E. Ganesan and D. K. Pradhan, "The hyperde Bruijn multiprocessor networks," inProc. 11th Conf. Distrib. Comput. Syst., May 1991, pp. 492499.
[14] E. Ganesan and D. K. Pradhan, "Optimal broadcasting in binary de Bruijn networks and hyperdeBruijn networks," inProc. 7th Int. Parallel Processing Symp., Apr. 1993.
[15] E. Ganesan and D. K. Pradhan, "Wormhole routing in debruijn networks," Tech. Rep. TAMU 93002, Texas A&M Univ., College Station, TX 77843, Jan. 1993.
[16] D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
[17] M. Imaseet al., "Connectivity of regular directed graphs with small diameter,"IEEE Trans. Comput., vol. C34, pp. 267273, Mar. 1985.
[18] S. L. Johnsson and C.T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 12491268, Sept. 1989.
[19] J. G. Kuhl and S. M. Reddy, "Distributed faulttolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[20] F. T. Leighton, "Parallel computing using mesh of trees," inProc. Workshop GraphTheoretic Concepts in Comput. Sci., 1983, pp. 200218.
[21] F. J. Meyer and D. K. Pradhan, "Fliptrees: Faulttolerant graphs with wide containers,"IEEE Trans. Comput., vol. 37, pp. 472478, Apr. 1988.
[22] W. Najjar and J.L. Gaudiot, "Network resilience: A measure of network faulttolerance,"IEEE Trans. Comput., vol. 39, pp. 174181, Feb 1990.
[23] D. Nathet al., "Efficient VLSI networks for parallel processing based on orthogonal trees,"IEEE Trans. Comput., vol. C32, pp. 569581, June 1983.
[24] NCUBE Corp., Beaverton,NCUBE/ten: An Overview, Nov. 1985.
[25] S. Ohring and S. K. Das, "Dynamic embeddings of trees and quasigrids into hyperdeBruijn networks," Tech. Rep. CRPDC9218, Dep. Comput. Sci., Denton, TX 762033886, Nov. 1992.
[26] D. K. Pradhan, "de Bruijn graph: an optimal interconnection network," Unpublished memo, Dep. Comput. Sci., Univ. of Regina, Regina, Canada., Apr. 1975.
[27] D. K. Pradhan, "Interconnection topologies for faulttolerant parallel and distributed architectures," inProc. 1981 Int. Conf. Parallel Processing, 1981, pp. 238244.
[28] D. K. Pradhan, "Dynamically restructurable faulttolerant processor network architecture,"IEEE Trans. Comput., May 1985.
[29] D. K. Pradhan and S. M. Reddy, "A faulttolerant communication architecture for distributed systems,"IEEE Trans. Comput., vol. C31, pp. 863870, Sept. 1982.
[30] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[31] P. Ramanathan and K. G. Shin, "A multiple copy approach for delivering messages under deadline constraints," inProc. FaultTolerant Comput. Symp., 1991, pp. 300307.
[32] A. L. Rosenberg, "Productshuffle networks: Toward reconciling shuffles and butterflies,"Discrete Appl. Math., no. 37/38, pp. 465488, 1992.
[33] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, pp. 867872, 1988.
[34] M. R. Samanthan and D. K. Pradhan, "The deBruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI,"IEEE Trans. Comput., vol. C38, pp. 567581, Apr. 1989. Also see corrections appeared in vol. 40, pp. 122, Jan. 1991.
[35] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., pp. 153161, Feb. 1971.
[36] A. Y. Wu, "Embedding of tree networks into hypercube,"J. Parallel Distributed Comput., vol. 2, pp. 238249, 1985.
[37] A. S. Youssef and B. Narahari, "The banyanhypercube networks,"IEEE Trans. Parallel Distributed Comput., vol. 1, pp. 160169, Apr. 1990.