Improving Valiant Routing for Slim Fly Networks
Improving Valiant Routing for Slim Fly Networks
复制标题
DOI：
10.1109/icppw.2017.33
复制
发表时间：
2017-08
期刊：
影响因子：
--
通讯作者：
Deyu Han;Zhaofeng Wang;David P. Bunde
中科院分区：
文献类型：
--
作者：
Deyu Han;Zhaofeng Wang;David P. Bunde
Valiant路由，使用随机中间节点来分配网络流量，已被提出用于许多最近的HPC网络拓扑。它也通常被用作自适应路由算法的构建块，自适应路由算法在可能的情况下使用最短路径路由，但在必要时恢复到Valiant路由以避免热点。我们证明了针对Slim fly拓扑提出的Valiant路由版本可以导致消息遵循环路，在返回到原始最短路径的边缘之前，在两个方向上使用一条边。在UGAL-L自适应路由算法中去除这些环路可以略微改善平均延迟，并允许网络在饱和前承载多达12%的流量。
Valiant routing, the use of a random intermediate node to distribute network traffic, has been proposed for a number of recent HPC network topologies. It is also commonly used as a bulding block for adaptive routing algorithms, which use shortest path routes when possible, but revert to Valiant routing when necessary to avoid hot spots. We show that the version of Valiant routing proposed for the Slim fly topology can cause messages to follow loops, using an edge in both directions before returning to edges of the original shortest path. Removing these loops in the UGAL-L adaptive routing algorithm is shown to provide slight improvements in average latency and also allow the network to carry up to 12% more traffic before saturation.