Algorithms and properties of a new two-level network with folded hypercubes as basic modules

• Published in: IEEE transactions on parallel and distributed systems Vol. 6; no. 7; pp. 714 - 723
• Main Authors: Duh, D.-R., Chen, G.-H., Fang, J.-F.
• Format: Journal Article
• Language: English
• Published: Los Alamitos, CA IEEE 01.07.1995; IEEE Computer Society
• Subjects: Applied sciences; Broadcasting; Computer architecture; Computer science; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Containers; Costs; Exact sciences and technology; Hypercubes; Integrated circuit interconnections; Multiprocessing systems; Routing; Software; Software engineering; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Topology; Encapsulation; Hamiltonian graph; Optimal algorithm; Ring; Hypercube; Interconnected power system; Routing; Hamiltonian circuit; Broadcasting program
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/71.395400

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, /spl kappa/-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, /spl kappa/-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.< >