Shortest-Path routing in spined cubes

Shortest-Path routing in spined cubes
复制标题

DOI：
10.1109/ict-ispc.2017.8075349
复制
发表时间：
2017-05
期刊：
2017 6th ICT International Student Project Conference (ICT-ISPC)
影响因子：
--
通讯作者：
Kaito Satoh;K. Kaneko;Phan Thi Hong Hanh;Huynh Thi Thanh Binh
Kaito Satoh;K. Kaneko;Phan Thi Hong Hanh;Huynh Thi Thanh Binh
中科院分区：
其他
文献类型：
--
作者：
Kaito Satoh;K. Kaneko;Phan Thi Hong Hanh;Huynh Thi Thanh Binh

文献摘要

相似文献

旋转立方体是超立方体的一种变体，它为大规模并行系统提供了一种很有前途的互连网络拓扑结构。N自旋立方体的直径几乎等于(n+3)/3，这是超立方体的变种中最小的。本文提出了一种旋转立方体的最短路径路由算法。
The spined cube is a variant of the hypercube and it provides a promising topology of interconnection networks for massively parallel systems. The diameter of the n-spined cube is almost equal to (n + 3) / 3, which is smallest among the variants of the hypercube. In this paper, we propose a shortest-path routing algorithm in spined cubes.