Layered shortest path (LASH) routing in irregular system area networks
Layered shortest path (LASH) routing in irregular system area networks
复制标题
不规则系统区域网络中的分层最短路径 (LASH) 路由
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Ingebjørg Theiss
中科院分区：
文献类型：
--
作者：
T. Skeie;Olav Lysne;Ingebjørg Theiss
近年来，我们已经看到了越来越多的兴趣，在不规则的网络拓扑结构的集群互连。与这种拓扑相关的一个问题是最短路径和无死锁路由的组合是困难的。因此，现有的不规则网络中路由解决方案要么保证相对于某些约束（例如up*/down*）的最短路径，要么必须通过非最小逃逸通道诉诸死锁恢复。在本文中，我们提出了一种方法，保证最短路径路由和顺序交付，并使用虚拟通道避免死锁。我们提出了一个理论上的上限所需的虚拟通道的数量，并通过广泛的实证测试，我们证明了虚拟通道的实际数量是非常低的，即使是大型网络。
In recent years we have seen a growing interest in irregular network topologies for cluster interconnects. One problem related to such topologies is that the combination of shortest path and deadlock free routing is difficult. As a result of this the existing solutions for routing in irregular networks either guarantee shortest paths relative to some constraint (like up*/down*), or have to resort to deadlock recovery through non-minimal escape channels. In this paper we propose a method that guarantees shortest path routing and in-order delivery, and that uses virtual channels for deadlock avoidance. We present a theoretical upper bound on the number of virtual channels needed, and through extensive empirical testing we demonstrate that the actual number of virtual channels is very low even for large networks.