This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Banyan-Hypercube Networks
April 1990 (vol. 1 no. 2)
pp. 160-169

The authors introduce a family of networks that are a synthesis of banyans and hypercubes and are called the banyan-hypercubes (BH). They combine the advantageous features of banyans and hypercubes and thus have better communication capabilities.The networks can be viewed as consisting of interconnecting hypercubes. It is shown that many hypercube features can be incorporated into BHs with regard to routing, embedding of rings and meshes, and partitioning, and that improvements over the hypercube result are made. In particular, it is shown that BHs have better diameters and average distances than hypercubes, and they embed pyramids and multiple pyramids with dilation cost 1. An optimal routing algorithm for BHs and an efficient partitioning strategy are presented.

[1] S. N. Bhatt and C. F. Ipsen, "How to embed trees in hypercubes," Res. Rep. YALEU/DCS/RR-443, Dep. Comput. Sci., Yale University, New Haven, CN, Dec. 1985.
[2] V. Cantoni and S. Levialdi, "PAPIA: A case history," inParallel Computer Vision(L. Uhr, Ed.). New York, NY: Academic, 1987.
[3] T. F. Chan and Y. Saad, "Multigrid algorithms on the hypercube multiprocessor,"IEEE Trans. Comput., vol. C-35, no. 11, pp. 969-977, Nov. 1986.
[4] S. Cheemalavagu and M. Malek, "Analysis and simulation in Banyan interconnection networks with 2×2, 4×4, 8×8 switching elements," inProc. 1982 Real-Time Syst. Symp., Dec. 1982, pp. 83-89.
[5] M.-S. Chen and K. G. Shin, "Processor allocation in anN-cube multiprocessorusing Gray codes,"IEEE Trans. Comput., vol. C-36, no. 12, pp. 1396-1407, Dec. 1987.
[6] D. DeGroot, "Mapping communication structures into SW-Banyan networks," Ph.D. dissertation, Univ. Texas, Austin, 1981.
[7] A. Esfahanian, L. M. Ni, and B. E. Sagan, "On enhancing hypercube multiprocessors," inProc. 1988 Int. Conf. Parallel Processing., Aug. 1988, pp. 86-89.
[8] R. L. Goke, "Banyan networks for partitioning multiprocessor systems," Ph.D. dissertation, Univ. Florida, Gainesville, 1976.
[9] J. R. Goodman and C. H. Sequin, "Hypertree: A multiprocessor interconnection topology,"IEEE Trans. Comput., vol. C-30, pp. 923-933, Dec. 1981.
[10] S. L. Johnsson, "Communication efficient basic linear algebra computations on hypercube architectures,"J. Parallel Distributed Comput., pp. 133-172, 1987.
[11] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1976.
[12] R. Miller and Q, F. Stout, "Simulating essential pyramids,"IEEE Trans. Comput., vol. 37, pp. 1642-1648, Dec. 1988.
[13] M. C. Pease, "The indirect binaryn-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[14] F. P. Preparata and J. E. Vuillemin, "The cube-connected cycles: A versatile network for parallel computation," inProc. 20th Symp. Foundations Comput. Sci., 1979, pp. 140-147.
[15] R. M. Jenevein and T. Mookken, "Traffic analysis of rectangular SW-Banyan networks," presented at The 15th Annu. Int. Symp. Comput. Architect.,Comput. Architect. News. vol. 16. no. 2, May 30-June 2, 1988, 333-342.
[16] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[17] M. Sejnowskiet al., "An overview of the Texas reconfigurable array computer," inProc. AFIPS Conf., vol. 49, NCC, 1980, pp. 631-641.
[18] H. J. Siegel,Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[19] Q. F. Stout, "Hypercubes and pyramids," inPyramidal Systems for Computer Vision, V. Cantoni and S. Levialdi, Eds. Berlin: Springer, 1986.
[20] C. L. Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.
[21] A. Youssef, "Properties of multistage interconnection networks," Ph.D. dissertation, Princeton Univ., Princeton, NJ, 1988.

Index Terms:
Index Termsbanyan-hypercube networks; communication capabilities; interconnecting hypercubes; routing; embedding of rings; partitioning; optimal routing algorithm; partitioning strategy; multiprocessor interconnection networks; parallel architectures; performance evaluation
Citation:
A.S. Youssef, B. Narahari, "The Banyan-Hypercube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 2, pp. 160-169, April 1990, doi:10.1109/71.80144
Usage of this product signifies your acceptance of the Terms of Use.