Extended minimal routing in 2-D meshes with faulty blocks

DOI10.1504/IJHPCN.2004.007573MaRDI QIDQ3549247zbMATH OpenOpenAlexFDO

Authors Jie Wu, Zhen Jiang

Publication date 21 December 2008

Published in International Journal of High Performance Computing and Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijhpcn.2004.007573

zbMATH Keywords

2D meshesfault modelsfault tolerancefaulty blockshigh assurancehigh performance computinghigh performance networking.minimal routingmulticomputer systemsmultiprocessorssimulationtwo-dimensional meshes

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A Fault-tolerant Adaptive and Minimal Routing Scheme in n-D Meshes
• Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks
• A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes
• Fault-tolerant routing in mesh-connected 2D tori
• ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES

Cited in

(4)

• ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES
• A Fault-tolerant Adaptive and Minimal Routing Scheme in n-D Meshes
• Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks
• A distributed formation of smallest faulty orthogonal convex polygons in 2-D meshes

This page was built for publication: Extended minimal routing in 2-D meshes with faulty blocks

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