论文信息 - On the k-ary Hypercube

On the k-ary Hypercube

Abstract In this paper, we propose and analyze a new interconnection network, the k -ary hypercube. This new architecture captures the advantages of the mesh network and those of the binary hypercube. We show that the hamiltoniacity of this network and its capability of efficiently simulating other topologies. It has a smaller degree than that of its equivalent binary hypercube (the one with at least as many nodes) and has a smaller diameter than its equivalent mesh of processors.

Saïd Bettayeb

[1] S. Lennart Johnsson,et al. On the Embedding of Arbitrary Meshes in Boolean Cubes With Expansion Two Dilation Two , 1987, ICPP.

[2] Arnold L. Rosenberg,et al. On Embedding Rectangular Grids in Square Grids , 1982, IEEE Transactions on Computers.

[3] Frank Thomson Leighton,et al. Reconfiguring a hypercube in the presence of faults , 1987, STOC.

[4] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[5] Arnold L. Rosenberg,et al. Encoding Data Structures in Trees , 1979, JACM.

[6] Saïd Bettayeb,et al. On the Multiply-Twisted Hypercube , 1994, Canada-France Conference on Parallel and Distributed Computing.

[7] Zevi Miller,et al. Embedding Grids into Hypercubes , 1992, J. Comput. Syst. Sci..

[8] Ilse C. F. Ipsen,et al. How to Embed Trees in Hypercubes. , 1985 .

[9] Fillia Makedon,et al. Polynomial time algorithms for the MIN CUT problem on degree restricted trees , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10] Ivan Hal Sudborough,et al. Simulating Binary Trees on Hypercubes , 1988, AWOC.

[11] John A. Ellis. Embedding Rectangular Grids into Square Grids , 1988, AWOC.

[12] Richard J. Lipton,et al. On Small Universal Data Structures and Related Combinatorial Problems. , 1978 .