On constructing the minimum orthogonal convex polygon in 2-D faulty meshes

@article{Wu2004OnCT,
  title={On constructing the minimum orthogonal convex polygon in 2-D faulty meshes},
  author={Jie Wu and Zhen Jiang},
  journal={18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.},
  year={2004},
  pages={12-}
}
Summary form only given. The rectangular faulty block model is the most commonly used fault model for designing fault-tolerant and deadlock-free routing algorithms in mesh-connected multicomputer. The convexity of a rectangle facilitates simple and efficient ways to route messages around fault regions using relatively few or no virtual channels to avoid deadlock. However, such a faulty block may include many nonfaulty nodes which are disabled, i.e., they are not involved in the routing process… CONTINUE READING