ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES

DOI10.1142/S0129054108006285zbMATH Open1171.68392OpenAlexW1973817314MaRDI QIDQ3606546FDOQ3606546

Authors: Zhen Jiang, Jie Wu 

Publication date: 26 February 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108006285

Recommendations

• Extended minimal routing in 2-D meshes with faulty blocks
• A Fault-tolerant Adaptive and Minimal Routing Scheme in $n$-D Meshes
• scientific article; zbMATH DE number 1990700
• Distributed algorithms for computing shortest pairs of disjoint paths
• A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes

zbMATH Keywords

routingfault information model

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Fault-tolerant wormhole routing algorithms for mesh networks
• Planar-adaptive routing

Cited In (6)

• Title not available (Why is that?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
• Extended minimal routing in 2-D meshes with faulty blocks
• An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size
• Title not available (Why is that?)

This page was built for publication: ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606546)