Folded-crossed hypercube: a complete interconnection network

In this paper, the complete folded-crossed hypercube FCQn is proposed based on the folded hypercube [IEEE Trans. Parall. Distrib. Syst. 2(1) (1991) 31], the enhanced hypercube [IEEE Trans. Comput. 40 (3) (1991) 284] and the crossed hypercube CQn [IEEE Trans. Parall. Distrib. Syst. 3 (5) (1992) 513]. FCQn has such appealing properties as diameter of [n/2], degree of n + 1, much short mean internode distance about 75-62.5% of that of n-cube for n ≥ 6, and very low message traffic density only about 0.667-0.625 for n ≥ 4. Therefore, FCQn is a high-performance-low-cost architecture. Additionally, a general formula of mean internode distance of the complete hypercube-type architecture is given in order to analyze different hypercube-type architectures easily.

[1]  Kai Hwang,et al.  Hypernet: A Communication-Efficient Architecture for Constructing Massively Parallel Computers , 1987, IEEE Transactions on Computers.

[2]  Krishnan Padmanabhan,et al.  the Twisted Cube Topology for Multiprocessors: A Study in Network Asymmetry , 1991, J. Parallel Distributed Comput..

[3]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[4]  Lionel M. Ni,et al.  The Twisted N-Cube with Application to Multiprocessing , 1991, IEEE Trans. Computers.

[5]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[6]  Nian-Feng Tzeng,et al.  Enhanced Hypercubes , 1991, IEEE Trans. Computers.

[7]  Kemal Efe.  A Variation on the Hypercube with Lower Diameter , 1991, IEEE Trans. Computers.

[8]  Kemal Efe.  Reconfigurable cube architecture for parallel computation , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[9]  Kemal Efe.  Programming the twisted-cube architectures , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.