Distributed Shortcut Networks: Layout-Aware Low-Degree Topologies Exploiting Small-World Effect
Distributed Shortcut Networks: Layout-Aware Low-Degree Topologies Exploiting Small-World Effect
复制标题
DOI：
10.1109/icpp.2013.71
复制
发表时间：
2013-10
期刊：
影响因子：
--
通讯作者：
V. Nguyen;Nhat T. X. Le;I. Fujiwara;M. Koibuchi
中科院分区：
文献类型：
--
作者：
V. Nguyen;Nhat T. X. Le;I. Fujiwara;M. Koibuchi
低通信延迟成为高度并行计算机和超级计算机关注的主要问题。随机网络拓扑结构最适合实现低平均最短路径长度和低节点间跳数直径，从而降低通信延迟。然而，随机拓扑会导致机房地板上总电缆长度增加的问题。在这种情况下，我们提出了利用小世界效应的低度非随机拓扑，这已经被一些随机网络模型很好地建模了。我们的主要想法是仔细设计一套不同长度的捷径，保持直径小，同时保持经济的电缆长度。我们的实验图分析表明，我们提出的拓扑具有低直径和低平均最短路径长度，大大优于对应的二维环面，并且接近具有相同平均度的对应随机拓扑。同时，该拓扑的平均电缆长度明显短于对应的随机拓扑。我们的周期精确网络仿真结果表明，与相同程度的环面相比，所提出的拓扑延迟降低了15%，吞吐量几乎相同。
Low communication latency becomes a main concern in highly parallel computers and supercomputers. Random network topologies are best to achieve low average shortest path length and low diameter in hop counts between nodes and thus low communication latency. However, random topologies lead to a problem of increased aggregate cable length on a machine room floor. In this context we propose low-degree non-random topologies that exploit the small-world effect, which has been typically well modeled by some random network models. Our main idea is to carefully design a set of various-length shortcuts that keep the diameter small while maintain an economical cable length. Our experimental graph analysis showed that our proposed topology has low diameter and low average shortest path length, which is considerably better than those of a counterpart 2-D torus and is near to those of a counterpart random topology with the same average degree. Meanwhile, the proposed topology has average cable length drastically shorter than that of the counterpart random topology. Our cycle-accurate network simulation results show that the proposed topology has lower latency by 15% and almost the same throughput when compared to torus with the same degree.