Layout-Conscious Expandable Topology for Low-Degree Interconnection Networks

Thao-Nguyen TRUONG; Khanh-Van NGUYEN; Ikki FUJIWARA; Michihiro KOIBUCHI

doi:10.1587/transinf.2015EDP7214

Layout-Conscious Expandable Topology for Low-Degree Interconnection Networks

Thao-Nguyen TRUONG, Khanh-Van NGUYEN, Ikki FUJIWARA, Michihiro KOIBUCHI

Full Text Views

0

Share
Cite this

Summary :

System expandability becomes a major concern for highly parallel computers and data centers, because their number of nodes gradually increases year by year. In this context we propose a low-degree topology and its floor layout in which a cabinet or node set can be newly inserted by connecting short cables to a single existing cabinet. Our graph analysis shows that the proposed topology has low diameter, low average shortest path length and short average cable length comparable to existing topologies with the same degree. When incrementally adding nodes and cabinets to the proposed topology, its diameter and average shortest path length increase modestly. Our discrete-event simulation results show that the proposed topology provides a comparable performance to 2-D Torus for some parallel applications. The network cost and power consumption of DSN-F modestly increase when compared to the counterpart non-random topologies.

Publication: IEICE TRANSACTIONS on Information Vol.E99-D No.5 pp.1275-1284

Publication Date: 2016/05/01

Publicized: 2016/02/02

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2015EDP7214

Type of Manuscript: PAPER

Category: Computer System

Authors

Thao-Nguyen TRUONG
  SOKENDAI (The Graduate University for Advanced Studies)
Khanh-Van NGUYEN
  Ha Noi University of Science and Technology
Ikki FUJIWARA
  National Institute of Informatics
Michihiro KOIBUCHI
  SOKENDAI (The Graduate University for Advanced Studies),National Institute of Informatics

Keyword

Network expandability, network topologies, small-world networks, interconnection networks, high-performance computing

Cite this

Copy

Thao-Nguyen TRUONG, Khanh-Van NGUYEN, Ikki FUJIWARA, Michihiro KOIBUCHI, "Layout-Conscious Expandable Topology for Low-Degree Interconnection Networks" in IEICE TRANSACTIONS on Information, vol. E99-D, no. 5, pp. 1275-1284, May 2016, doi: 10.1587/transinf.2015EDP7214.
Abstract: System expandability becomes a major concern for highly parallel computers and data centers, because their number of nodes gradually increases year by year. In this context we propose a low-degree topology and its floor layout in which a cabinet or node set can be newly inserted by connecting short cables to a single existing cabinet. Our graph analysis shows that the proposed topology has low diameter, low average shortest path length and short average cable length comparable to existing topologies with the same degree. When incrementally adding nodes and cabinets to the proposed topology, its diameter and average shortest path length increase modestly. Our discrete-event simulation results show that the proposed topology provides a comparable performance to 2-D Torus for some parallel applications. The network cost and power consumption of DSN-F modestly increase when compared to the counterpart non-random topologies.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.2015EDP7214/_p

Copy

@ARTICLE{e99-d_5_1275,
author={Thao-Nguyen TRUONG, Khanh-Van NGUYEN, Ikki FUJIWARA, Michihiro KOIBUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={Layout-Conscious Expandable Topology for Low-Degree Interconnection Networks},
year={2016},
volume={E99-D},
number={5},
pages={1275-1284},
abstract={System expandability becomes a major concern for highly parallel computers and data centers, because their number of nodes gradually increases year by year. In this context we propose a low-degree topology and its floor layout in which a cabinet or node set can be newly inserted by connecting short cables to a single existing cabinet. Our graph analysis shows that the proposed topology has low diameter, low average shortest path length and short average cable length comparable to existing topologies with the same degree. When incrementally adding nodes and cabinets to the proposed topology, its diameter and average shortest path length increase modestly. Our discrete-event simulation results show that the proposed topology provides a comparable performance to 2-D Torus for some parallel applications. The network cost and power consumption of DSN-F modestly increase when compared to the counterpart non-random topologies.},
keywords={},
doi={10.1587/transinf.2015EDP7214},
ISSN={1745-1361},
month={May},}

Copy

TY - JOUR
TI - Layout-Conscious Expandable Topology for Low-Degree Interconnection Networks
T2 - IEICE TRANSACTIONS on Information
SP - 1275
EP - 1284
AU - Thao-Nguyen TRUONG
AU - Khanh-Van NGUYEN
AU - Ikki FUJIWARA
AU - Michihiro KOIBUCHI
PY - 2016
DO - 10.1587/transinf.2015EDP7214
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2016
AB - System expandability becomes a major concern for highly parallel computers and data centers, because their number of nodes gradually increases year by year. In this context we propose a low-degree topology and its floor layout in which a cabinet or node set can be newly inserted by connecting short cables to a single existing cabinet. Our graph analysis shows that the proposed topology has low diameter, low average shortest path length and short average cable length comparable to existing topologies with the same degree. When incrementally adding nodes and cabinets to the proposed topology, its diameter and average shortest path length increase modestly. Our discrete-event simulation results show that the proposed topology provides a comparable performance to 2-D Torus for some parallel applications. The network cost and power consumption of DSN-F modestly increase when compared to the counterpart non-random topologies.
ER -