A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching

Yuri Nishikawa, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano

研究成果: Conference contribution

抄録

System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called "Semi-deflection". Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual channels by allowing non-blocking transfer between specific pairs of routers. As the result of throughput evaluation, Semideflection routing improved throughput by up to 26 percent compared with that of north-last turn model, which is a typical adaptive routing, and also reduced latency.

本文言語English
ホスト出版物のタイトルProceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010
ページ431-438
ページ数8
DOI
出版ステータスPublished - 2010 10 27
イベント5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010 - Macau, China
継続期間: 2010 7 152010 7 17

出版物シリーズ

名前Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010

Other

Other5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010
国/地域China
CityMacau
Period10/7/1510/7/17

ASJC Scopus subject areas

  • ハードウェアとアーキテクチャ
  • 電子工学および電気工学

フィンガープリント

「A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル