On some properties of k-ary n-cubes

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

*المؤلف المقابل لهذا العمل

نتاج البحث

16 اقتباسات (Scopus)

ملخص

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.

اللغة الأصليةEnglish
عنوان منشور المضيفProceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
الصفحات517-524
عدد الصفحات8
حالة النشرPublished - 2001
الحدث8th International Conference on Parallel and Distributed Systems - Kyongju
المدة: يونيو ٢٦ ٢٠٠١يونيو ٢٩ ٢٠٠١

Other

Other8th International Conference on Parallel and Distributed Systems
الدولة/الإقليمKorea, Republic of
المدينةKyongju
المدة٦/٢٦/٠١٦/٢٩/٠١

ASJC Scopus subject areas

  • ???subjectarea.asjc.2200???

بصمة

أدرس بدقة موضوعات البحث “On some properties of k-ary n-cubes'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا