Shortest-Path routing in spined cubes

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-p...

Full description

Saved in:
Bibliographic Details
Published in2017 6th ICT International Student Project Conference (ICT-ISPC) pp. 1 - 4
Main Authors Satoh, Kaito, Kaneko, Keiichi, Hong Hanh, Phan Thi, Thanh Binh, Huynh Thi
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2017
Subjects
diameter
hypercube
Hypercubes
interconnection network
Network topology
Parallel processing
Program processors
Routing
Topology
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.1109/ICT-ISPC.2017.8075349