LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies
LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies
复制标题
DOI：
10.1109/candar.2016.0019
复制
发表时间：
2016-11
期刊：
影响因子：
--
通讯作者：
Ryuta Kawano;Hiroshige Nakahara;I. Fujiwara;Hiroki Matsutani;M. Koibuchi;H. Amano
中科院分区：
文献类型：
--
作者：
Ryuta Kawano;Hiroshige Nakahara;I. Fujiwara;Hiroki Matsutani;M. Koibuchi;H. Amano
端到端网络延迟已成为大规模高性能计算（HPC）系统上并行应用的重要问题。已有研究表明，随机连接的交换机间网络可以降低端到端的网络延迟。代价是大量的路由信息。对于不规则网络，最小路由是通过使用网络中所有目的地的路由表来实现的。在这项工作中，一种新的分布式路由方法称为LOREN（面向布局的路由与邻居），以实现低延迟与小路由表提出了不规则的网络，其链路长度是有限的。路由表包含物理上和拓扑上邻近的邻居节点，以确保节点之间的活锁自由和少量跳数。实验结果表明，与传统的紧凑路由方法相比，LOREN减少了2.8%的平均时延，提高了39%的网络吞吐量。此外，所需的路由表大小减少了高达67%，这提高了可扩展性和实施的灵活性。
End-to-end network latency has become an important issue for parallel application on large-scale high performance computing (HPC) systems. It has been reported that randomly-connected inter-switch networks can lower the end-to-end network latency. The trade-off is a large amount of routing information. For irregular networks, minimal routing is achieved by using routing tables for all destinations in the network. In this work, a novel distributed routing method called LOREN (Layout-Oriented Routing with Entries for Neighbors) to achieve low-latency with a small routing table is proposed for irregular networks whose link length is limited. The routing tables contain both physically and topologically nearby neighbor nodes to ensure livelock-freedom and a small number of hops between nodes. Experimental results show that LOREN reduces the average latencies by 2.8% and improves the network throughput by up to 39% compared with a conventional compact routing method. Moreover, the required routing table size is reduced by up to 67%, which improves scalability and flexibility for implementation.