LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI:10.1109/CANDAR.2016.0019

Ryuta Kawano, Hiroshige Nakahara, I. Fujiwara, Hiroki Matsutani, M. Koibuchi, H. Amano

{"title":"LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies","authors":"Ryuta Kawano, Hiroshige Nakahara, I. Fujiwara, Hiroki Matsutani, M. Koibuchi, H. Amano","doi":"10.1109/CANDAR.2016.0019","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDAR.2016.0019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

Abstract

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.

查看原文本刊更多论文

LOREN:布局意识随机拓扑的可扩展路由方法

端到端网络延迟已经成为大规模高性能计算(HPC)系统上并行应用的一个重要问题。有报道称，交换机间随机连接的网络可以降低端到端网络延迟。代价是大量的路由信息。对于不规则网络，通过对网络中所有目的地使用路由表来实现最小路由。在这项工作中，提出了一种新的分布式路由方法，称为LOREN(面向布局的路由与邻居的条目)，以实现低延迟与小路由表的不规则网络的链路长度有限。路由表包含物理上和拓扑上邻近的邻居节点，以确保活畜自由和节点之间的跳数较少。实验结果表明，与传统的紧凑路由方法相比，LOREN平均延迟降低了2.8%，网络吞吐量提高了39%。此外，所需的路由表大小最多减少了67%，这提高了实现的可伸缩性和灵活性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2016 Fourth International Symposium on Computing and Networking (CANDAR)

自引率

0.00%

发文量