On some properties of k-ary n-cubes

H. Sarbazi-Azad, M. Ould-Khaoua, L. M. Mackenzie, S. G. Akl

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

The k-ary n-cube has been used as the underlying topology for most practical multicomputers, and has been extensively studied in the past. In this paper, 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.

Original languageEnglish
Title of host publicationProceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
Pages517-524
Number of pages8
Publication statusPublished - 2001
Event8th International Conference on Parallel and Distributed Systems - Kyongju, Korea, Republic of
Duration: Jun 26 2001Jun 29 2001

Other

Other8th International Conference on Parallel and Distributed Systems
CountryKorea, Republic of
CityKyongju
Period6/26/016/29/01

Fingerprint

Topology

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L. M., & Akl, S. G. (2001). On some properties of k-ary n-cubes. In Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS (pp. 517-524)

On some properties of k-ary n-cubes. / Sarbazi-Azad, H.; Ould-Khaoua, M.; Mackenzie, L. M.; Akl, S. G.

Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. 2001. p. 517-524.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sarbazi-Azad, H, Ould-Khaoua, M, Mackenzie, LM & Akl, SG 2001, On some properties of k-ary n-cubes. in Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. pp. 517-524, 8th International Conference on Parallel and Distributed Systems, Kyongju, Korea, Republic of, 6/26/01.
Sarbazi-Azad H, Ould-Khaoua M, Mackenzie LM, Akl SG. On some properties of k-ary n-cubes. In Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. 2001. p. 517-524
Sarbazi-Azad, H. ; Ould-Khaoua, M. ; Mackenzie, L. M. ; Akl, S. G. / On some properties of k-ary n-cubes. Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. 2001. pp. 517-524
@inproceedings{f64549249b9343e68ea68d592c7e87e9,
title = "On some properties of k-ary n-cubes",
abstract = "The k-ary n-cube has been used as the underlying topology for most practical multicomputers, and has been extensively studied in the past. In this paper, 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.",
author = "H. Sarbazi-Azad and M. Ould-Khaoua and Mackenzie, {L. M.} and Akl, {S. G.}",
year = "2001",
language = "English",
pages = "517--524",
booktitle = "Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS",

}

TY - GEN

T1 - On some properties of k-ary n-cubes

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

AU - Akl, S. G.

PY - 2001

Y1 - 2001

N2 - The k-ary n-cube has been used as the underlying topology for most practical multicomputers, and has been extensively studied in the past. In this paper, 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.

AB - The k-ary n-cube has been used as the underlying topology for most practical multicomputers, and has been extensively studied in the past. In this paper, 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.

UR - http://www.scopus.com/inward/record.url?scp=0034851199&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034851199&partnerID=8YFLogxK

M3 - Conference contribution

SP - 517

EP - 524

BT - Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS

ER -