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

DOI10.1142/S0129054108006285MaRDI QIDQ3606546zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

routingfault information model

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

• A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
• scientific article; zbMATH DE number 1990700 (Why is no real title available?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size
• scientific article; zbMATH DE number 1305438 (Why is no real title available?)
• Extended minimal routing in 2-D meshes with faulty blocks

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)