Deadlock-free layered routing for infiniband networks

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
出版社Institute of Electrical and Electronics Engineers Inc.
ページ84-90
ページ数7
ISBN(電子版)9781728152684
DOI
出版ステータスPublished - 2019 11
イベント7th International Symposium on Computing and Networking Workshops, CANDARW 2019 - Nagasaki, Japan
継続期間: 2019 11 262019 11 29

出版物シリーズ

名前Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019

Conference

Conference7th International Symposium on Computing and Networking Workshops, CANDARW 2019
国/地域Japan
CityNagasaki
Period19/11/2619/11/29

ASJC Scopus subject areas

  • ハードウェアとアーキテクチャ
  • 情報システム
  • 人工知能
  • コンピュータ ネットワークおよび通信

フィンガープリント

「Deadlock-free layered routing for infiniband networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル