Volume 3 Number 10 (Oct. 2008)
Home > Archive > 2008 > Volume 3 Number 10 (Oct. 2008) >
JCP 2008 Vol.3(10): 58-65 ISSN: 1796-203X
doi: 10.4304/jcp.3.10.58-65

A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing

LIU Youyao1, HAN Jungang2, DU Huimin2
1Microelectronics School, XIDIAN University, Xi’an, 710071, China
2Xi'an Institute of Posts & Telecommunications, Xi’an, 710121, China

Abstract—An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop Hypercube (DLH), is proposed. The DLH network combines the positive features of the hypercube topology, such as small diameter, high connectivity, symmetry and simple routing, and the scalability and constant node degree of a new double-loop topology. The DLH network can maintain a constant node degree regardless of the increase in the network size. The nodes of the DLH network adopt the hybrid coding combining Johnson code and Gray code. The hybrid coding scheme can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms are designed for the DLH network, and it is based on the hybrid coding scheme. A detailed analysis shows that the DLH network is a better interconnection network in the properties of topology and the performance of communication. Moreover, it also adopts a threedimensional optical design methodology based on free-space optics. The optical implementation has totally spaceinvariant connection patterns at every node, which enables the DLH to be highly amenable to optical implementation using simple and efficient large space-bandwidth product space-invariant optical elements.

Index Terms—interconnection network, scalability, massively parallel computing, hypercube, double-loop, optical interconnect

[PDF]

Cite: LIU Youyao, HAN Jungang, DU Huimin, "A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing," Journal of Computers vol. 3, no. 10, pp. 58-65, 2008.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>