TY - GEN
T1 - Deadlock-free layered routing for infiniband networks
AU - Kawano, Ryuta
AU - Matsutani, Hiroki
AU - Amano, Hideharu
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/11
Y1 - 2019/11
N2 - End-to-end network latency has become an important issue for big data processing on large-scale and heterogeneous data centers. To realize them, a low-latency inter-switch network is required. In recent years, a novel network based on a random regular graph such as Jellyfish has been proposed as a solution to these problems. To realize this network on Infiniband, we explore layered shortest path routing that guarantees deadlock freedom. Infiniband can avoid deadlocks by using Virtual Lane (VL), which is a QoS guarantee mechanism. However, the output VL is indirectly determined by using Service Level (SL) held by each packet. In this research, to minimize the number of consumed SLs, we propose an algorithm based on a graph coloring problem to assign SLs to all source-destination pairs. The proposed method can reduce the number of consumed SLs by up to 38%compared to the conventional SL mapping method.
AB - End-to-end network latency has become an important issue for big data processing on large-scale and heterogeneous data centers. To realize them, a low-latency inter-switch network is required. In recent years, a novel network based on a random regular graph such as Jellyfish has been proposed as a solution to these problems. To realize this network on Infiniband, we explore layered shortest path routing that guarantees deadlock freedom. Infiniband can avoid deadlocks by using Virtual Lane (VL), which is a QoS guarantee mechanism. However, the output VL is indirectly determined by using Service Level (SL) held by each packet. In this research, to minimize the number of consumed SLs, we propose an algorithm based on a graph coloring problem to assign SLs to all source-destination pairs. The proposed method can reduce the number of consumed SLs by up to 38%compared to the conventional SL mapping method.
KW - High-Performance Computing
KW - Interconnection Networks
KW - Routing Algorithms
UR - http://www.scopus.com/inward/record.url?scp=85078850964&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078850964&partnerID=8YFLogxK
U2 - 10.1109/CANDARW.2019.00023
DO - 10.1109/CANDARW.2019.00023
M3 - Conference contribution
AN - SCOPUS:85078850964
T3 - Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
SP - 84
EP - 90
BT - Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
Y2 - 26 November 2019 through 29 November 2019
ER -