A distributed formation of smallest faulty orthogonal convex polygons in 2-D meshes

DOI10.1006/JPDC.2002.1842zbMATH Open1004.68001OpenAlexW1966495249MaRDI QIDQ701168FDOQ701168

Authors: Jie Wu 

Publication date: 16 October 2002

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2002.1842

Recommendations

• Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks
• An improved fault-tolerant routing algorithm in meshes with convex faults
• Extended minimal routing in 2-D meshes with faulty blocks
• Fault-tolerant routing in mesh-connected 2D tori
• Fault-tolerant wormhole routing in mesh with overlapped solid fault regions

zbMATH Keywords

distributed algorithmsfault toleranceroutingfault models2-dimensional meshes (tori)orthogonal convex polygons

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07)

This page was built for publication: A distributed formation of smallest faulty orthogonal convex polygons in 2-D meshes

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