Routing Algorithms Based on 2D Turn Model for Irregular Networks

Authors:
Affiliations:
Venue:
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
2002

Citing 0
Cited 3

Path selection algorithm: the strategy for designing deterministic routing from alternative paths

Parallel Computing
An Effective Design of Deadlock-Free Routing Algorithms Based on 2D Turn Model for Irregular Networks

IEEE Transactions on Parallel and Distributed Systems
Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to solve traffic unbalancing caused by up/down routing for irregular networks, two-dimensional direction is introduced into a spanning tree, and novel routing algorithms based on two-dimensional turn model are proposed. The proposed algorithms improve traffic balancing by selecting prohibited turns for deadlock-free carefully. Simulation results demonstrate that proposed algorithms improve both the performance and stability.