L-turn routing: An adaptive routing in irregular networks

M Koibuchi, A Funahashi, A Jouraku… - … on Parallel Processing …, 2001 - ieeexplore.ieee.org
International Conference on Parallel Processing, 2001., 2001ieeexplore.ieee.org
Network-based parallel processing using commodity personal computers has been widely
developed. Since such systems require high degree of flexibility and scalability of wiring, a
high-speed network with an irregular topology is often needed. In traditional routing
algorithms for irregular networks, available paths are considerably restricted in order to
avoid deadlocks. In this paper we propose a novel routing algorithm called left-up-first turn
routing (L-turn routing), which makes a better traffic balancing in irregular networks by …
Network-based parallel processing using commodity personal computers has been widely developed. Since such systems require high degree of flexibility and scalability of wiring, a high-speed network with an irregular topology is often needed. In traditional routing algorithms for irregular networks, available paths are considerably restricted in order to avoid deadlocks. In this paper we propose a novel routing algorithm called left-up-first turn routing (L-turn routing), which makes a better traffic balancing in irregular networks by building a specific spanning tree. Result of simulations shows that L-turn routing achieves better performance than traditional ones with each topology.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果