J-STAGE Home  >  Publications - Top  > Bibliographic Information

IEICE Transactions on Information and Systems
Vol. E99.D (2016) No. 5 pp. 1275-1284



Regular Section

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.

Copyright © 2016 The Institute of Electronics, Information and Communication Engineers

Article Tools

Share this Article