抄録
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.
| 元の言語 | English |
|---|---|
| ホスト出版物のタイトル | Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016 |
| 出版者 | Institute of Electrical and Electronics Engineers Inc. |
| ページ | 9-18 |
| ページ数 | 10 |
| ISBN（電子版） | 9781509026555 |
| DOI | |
| 出版物ステータス | Published - 2017 1 13 |
| イベント | 4th International Symposium on Computing and Networking, CANDAR 2016 - Hiroshima, Japan 継続期間: 2016 11 22 → 2016 11 25 |
Other
| Other | 4th International Symposium on Computing and Networking, CANDAR 2016 |
|---|---|
| 国 | Japan |
| 市 | Hiroshima |
| 期間 | 16/11/22 → 16/11/25 |
Fingerprint
ASJC Scopus subject areas
- Computer Science Applications
- Hardware and Architecture
- Signal Processing
- Computer Networks and Communications
これを引用
LOREN : A scalable routing method for layout-conscious random topologies. / Kawano, Ryuta; Nakahara, Hiroshi; Fujiwara, Ikki; Matsutani, Hiroki; Koibuchi, Michihiro; Amano, Hideharu.
Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 9-18 7818589.研究成果: Conference contribution
}
TY - GEN
T1 - LOREN
T2 - A scalable routing method for layout-conscious random topologies
AU - Kawano, Ryuta
AU - Nakahara, Hiroshi
AU - Fujiwara, Ikki
AU - Matsutani, Hiroki
AU - Koibuchi, Michihiro
AU - Amano, Hideharu
PY - 2017/1/13
Y1 - 2017/1/13
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85015240421&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015240421&partnerID=8YFLogxK
U2 - 10.1109/CANDAR.2016.12
DO - 10.1109/CANDAR.2016.12
M3 - Conference contribution
AN - SCOPUS:85015240421
SP - 9
EP - 18
BT - Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016
PB - Institute of Electrical and Electronics Engineers Inc.
ER -