A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing

Inter-switch networks for HPC systems and data-centers can be improved by applying random shortcut topologies with a reduced number of hops. With minimal routing in such networks; however, deadlock-freedom is not guaranteed. Multiple Virtual Channels (VCs) are efficiently used to avoid this problem....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Information and Systems 2017/08/01, Vol.E100.D(8), pp.1798-1806
Hauptverfasser:	KAWANO, Ryuta, NAKAHARA, Hiroshi, TADE, Seiichi, FUJIWARA, Ikki, MATSUTANI, Hiroki, KOIBUCHI, Michihiro, AMANO, Hideharu
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Complexity deadlock-free routing Hash based algorithms Heuristic methods high performance computing Switching theory time complexity Virtual networks
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!