This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
July 1995 (vol. 6 no. 7)
pp. 714-723

Abstract—In this paper, a new two-level interconnection network, called a hierarchical folded-hypercube network (HFN, for short), is proposed. The HFN takes folded hypercubes as basic modules which are connected in a complete manner. We investigate the topological properties of the HFN, including the diameter, cost, average distance, embedding, connectivity, container, κ-wide diameter, and node-fault diameter. We show that the HFN can emulate algorithms which are executable on the ring or the mesh-connected computer with the same time complexities in big-O notation. Moreover, the HFN can embed a folded hypercube having the same number of nodes with constant dilation. We compute the diameter, node connectivity, best container, κ-wide diameter, and node-fault diameter of the HFN. We present optimal routing and broadcasting algorithms for the HFN. The semigroup computation and descend/ascend algorithms can be executed as well on the HFN.

[1] S.B. Akers,D. Harel,, and B. Krishnamurthy,“The star graph: An attractive alternative to the n-cube,” Proc. Int’l Conf. Parallel Processing, pp. 393-400, 1987.
[2] Ametek Corporation, Ametek Series 2010 Brochures.
[3] L.N. Bhuyan and D.P. Agrawal,“Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, 1984.
[4] J. Bondy and U. Murthy,Graph Theory with Applications. Macmillan Press, 1976.
[5] M. S. Chen and K. G. Shin,“Processor allocation in an$N$-cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C-37, pp. 1396–1407, Dec. 1987.
[6] S.P. Dandamudi and D.L. Eager, "Hierarchical Interconnection Networks for Multicomputer Systems," IEEE Trans. Computers, pp. 786-797, 1990.
[7] K. Efe, “The Crossed Cube Architecture for Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513-524, Sept.-Oct. 1992.
[8] A. El-Amawy and S. Latifi,“Bridged hypercube networks,” J. Parallel and Distributed Computing, vol. 10, no. 1, pp. 90-95, 1990.
[9] A. El-Amawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 31-42, 1991.
[10] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, "The Twisted n-Cube with Application to Multiprocessing," IEEE Trans. Computers, vol. 40, no. 1, pp. 88-93, Jan. 1991.
[11] K. Ghose and K. R. Desai,“The HCN: A versatile interconnection network based on cubes,”inProc. Supercomputing '89, pp. 426–435.
[12] K. Ghose and K.R. Desai,“The design and evaluation of the hierarchical cubic network,” Proc. Int’l Conf. Parallel Processing, vol. 1, pp. 355-362, 1990.
[13] J. Gilbert and L. Gilbert,Elements of Modern Algebra. PWS-KENT Publishing Co., 2nd edition, 1988.
[14] D.F. Hsu,“On container width and length in graphs, groups, and networks,” IEICE Trans. Fundamentals, vol. E77-A, no. 4, pp. 668-680, Apr., 1994.
[15] M.S. Krishnamoorty and B. Krishnamoorty, "Fault diameter of interconnection networks," Computers and Mathematics with Applications, vol. 13, no. 5-6, pp. 577-582, 1987.
[16] K. Hwang and J. Ghosh, "Hypernet: A Communication Efficient Architecture for Constructing Massively Parallel Computers," IEEE Trans. Computers, pp. 1,450-1,466, 1987.
[17] Intel Corporation, The iSPC Data Sheet,Beaverton, Ore., 1985.
[18] J.M. Kumar and L.M. Patnaik, "Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes," IEEE Trans. Parallel and Distributed Systems, pp. 45-57, 1992.
[19] S. Lakshmivarahan and S.K. Dhall,“A new hierarchy of hypercube interconnection schemes for parallel computers,” J. Supercomputing, vol. 2. no. 1, pp. 81-108, 1988.
[20] B.L. Menezes and R. Jenevein,“The KYKLOS multicomputer network: Interconnection strategies, properties, and applications,” IEEE Trans. Computers, vol. 40, no. 6, pp. 693-705, 1991.
[21] NCUBE Corporation, NCUBE Handbook,Beaverton, Ore., 1986.
[22] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[23] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[24] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[25] L.W. Tucker and G.G. Robertson, Architecture and Applications of the Connection Machine Computer, vol. 21, no. 8, pp. 26-38, Aug. 1988.
[26] G.D. Vecchia and C. Sanges, “A Recursively Scalable Network VLSI Implementation,” Future Generation Computer Systems, vol. 4, no. 3, pp. 235-243, 1988.
[27] A. Youssef and B. Narahari, "Banyan-Hypercube Networks," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 160-169, Apr. 1990.

Index Terms:
Broadcasting algorithm, connectivity, container, diameter, embedding, Hamiltonian circuit, interconnection network, κ-wide diameter, node-fault diameter, routing algorithm.
Citation:
Dyi-Rong Duh, Gen-Huey Chen, Jywe-Fei Fang, "Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 7, pp. 714-723, July 1995, doi:10.1109/71.395400
Usage of this product signifies your acceptance of the Terms of Use.