Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
IEEE Transactions on Computers
Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes
IEEE Transactions on Computers
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Unreliable data delivery due to network instability leads general network systems to serious situations. Especially in case of reliability-critical applications, a fault-tolerant routing is gaining more attention for guaranteeing complete data transmission even in the presence of faults. In the paper, a concise approach to the genetic design of the optimal fault-tolerant routing algorithm in a 2D-meshed network using GA(Genetic Algorithm) is proposed. The algorithm is based on the wormhole routing scheme with virtual channels for accomplishing deadlock-freedom. It permits the packets to return to the node where they previously stayed, and is adaptive to concurrently evolve its elementary strategies enhancing the associated performance. We perform computer simulations in a 10脳10 meshed network to compare the proposed algorithm with the representative conventional one.