The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—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-<it>O</it> 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.</p>
Broadcasting algorithm, connectivity, container, diameter, embedding, Hamiltonian circuit, interconnection network, κ-wide diameter, node-fault diameter, routing algorithm.

J. Fang, D. Duh and G. Chen, "Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 714-723, 1995.
91 ms
(Ver 3.3 (11022016))