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-path routing algorithm in spined cubes.

[1]  Deyu Qi,et al.  The twisted crossed cube , 2016, Concurr. Comput. Pract. Exp..

[2]  Fan Jian.  BC Interconnection Networks and Their Properties , 2003 .

[3]  Krishnan Padmanabhan,et al.  the Twisted Cube Topology for Multiprocessors: A Study in Network Asymmetry , 1991, J. Parallel Distributed Comput..

[4]  Xiaohua Jia,et al.  The spined cube: A new hypercube variant with smaller diameter , 2011, Inf. Process. Lett..

[5]  Qiang Zhu,et al.  On the reliability and fault tolerance of spined cubes , 2012, 2012 International Conference on Wavelet Analysis and Pattern Recognition.

[6]  P. Cull,et al.  The Mobius Cubes , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.

[7]  Kemal Efe.  A Variation on the Hypercube with Lower Diameter , 1991, IEEE Trans. Computers.