On the K-ary Hypercube
| dc.contributor.author | Bettyeb, Said | |
| dc.date.accessioned | 2020-05-04T15:34:44Z | |
| dc.date.available | 2020-05-04T15:34:44Z | |
| dc.date.issued | 1995 | |
| dc.description.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. | en_US |
| dc.identifier.citation | • On the K-ary Hypercube, Theoretical Computer Science Journal: 140, Issue 2, April 1995, pp. 333-339. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10657.1/2320 | |
| dc.publisher | Theoretical Computer Science Journal | en_US |
| dc.subject | Grid network Interconnection Mesh networking Dilation (morphology) Simulation Hash table Many-one reduction Central processing unit One-to-one (data model) | en_US |
| dc.title | On the K-ary Hypercube | en_US |
| dc.type | Article | en_US |