On the K-ary Hypercube
Date
1995
Authors
Bettyeb, Said
Journal Title
Journal ISSN
Volume Title
Publisher
Theoretical Computer Science Journal
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.
Description
Keywords
Grid network Interconnection Mesh networking Dilation (morphology) Simulation Hash table Many-one reduction Central processing unit One-to-one (data model)
Citation
• On the K-ary Hypercube, Theoretical Computer Science Journal: 140, Issue 2, April 1995, pp. 333-339.