Descending layers routing: a deadlock-free deterministic routing using virtual channels in system area networks with irregular topologies
Descending layers routing: a deadlock-free deterministic routing using virtual channels in system area networks with irregular topologies
复制标题
降序层路由：在具有不规则拓扑的系统区域网络中使用虚拟通道的无死锁确定性路由
DOI：
10.1109/icpp.2003.1240620
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
H. Amano
中科院分区：
文献类型：
--
作者：
M. Koibuchi;A. Jouraku;Konosuke Watanabe;H. Amano
系统区域网络（SAN），通常接受不规则的拓扑结构，已被用来连接PC/WS集群或高性能存储系统中的节点。由于虫洞或虚拟直通传输用于低延迟通信，因此无死锁路由在SAN中至关重要。我们提出了一种新的无死锁的确定性路由称为下降层（DL）的SAN路由。为了减少非最小路径和流量拥塞，网络被划分成层的子网具有相同的拓扑结构，使用虚拟通道，并建立了大量的路径跨多个子网。在一个真实的PC集群RHiNET-2上实现了DL路由，运行结果表明，与上行/下行路由相比，DL路由的吞吐量提高了33%.与上行/下行路由相比，其屏障同步的执行时间也提高了29%。各种规模和拓扑结构的仿真结果也表明，DL路由实现了高达266%的吞吐量的提高相比，向上 */向下 * 路由。
System area networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Since wormhole or virtual cut-through transfer is used for low latency communication, deadlock-free routings are essential in SANs. We propose a novel deadlock-free deterministic routing called descending layers (DL) routing for SANs. In order to reduce both nonminimal paths and traffic congestion, the network is divided into layers of subnetworks with the same topology using virtual channels, and a large number of paths across multiple subnetworks are established. The DL routing is implemented on a real PC cluster called RHiNET-2, and execution results show that its throughput is improved up to 33% compared with that of up*/down* routing. Its execution time of a barrier synchronization is also improved 29% compared with that of up*/down* routing. Simulation results of various sizes and topologies also show that the DL routing achieves up to 266% improvement on throughput compared with up*/down* routing.