On some properties of k-ary n-cubes

The k-ary n-cube has been used as the underlying topology for most practical multicomputers, and has been extensively studied in the past. We investigate some properties of this network. In particular, we study the problem of finding the number of nodes located i hops away from a given node (surface...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 s. 517 - 524
Hlavní autori: Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M., Akl, S.G.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2001
Predmet:
Broadcasting
Delay
Hamming distance
Hypercubes
Load management
Multiprocessor interconnection networks
Network topology
Routing
Tree data structures
ISBN:0769511538, 9780769511535
ISSN:1521-9097
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The k-ary n-cube has been used as the underlying topology for most practical multicomputers, and has been extensively studied in the past. We investigate some properties of this network. In particular, we study the problem of finding the number of nodes located i hops away from a given node (surface area) and the number of nodes located within i hops away from a given node (volume) in both the unidirectional and bidirectional k-ary n-cube, and have derived exact expressions calculating these numbers. These results are very useful when studying, for example, the spanning tree structure of the k-ary n-cube and the problem of resource placement in this network.
ISBN:0769511538
9780769511535
ISSN:1521-9097
DOI:10.1109/ICPADS.2001.934861