Layout-Conscious Expandable Topology for Low-Degree Interconnection Networks

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

Publication
IEICE TRANSACTIONS on Information and Systems   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
Keyword: 
Network expandability,  network topologies,  small-world networks,  interconnection networks,  high-performance computing,  

Full Text: PDF>>
Buy this Article




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.