Computational geometry: an introduction
Computational geometry: an introduction
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
Journal of the ACM (JACM)
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
IEEE Transactions on Computers
An Improved Algorithm for Fault-Tolerant Wormhole Routing in Meshes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Microprocessors: the off-beat generation
IEEE Spectrum
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Creating Simulation Capabilities
IEEE Computational Science & Engineering
Communication in Multicomputers with Nonconvex Faults
IEEE Transactions on Computers
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Origin-based fault-tolerant routing in the mesh
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model
IEEE Transactions on Computers
| Hi-index | 0.00 |
The rectangular faulty block model is the most commonly used fault model for designing fault-tolerant and deadlock-free routing algorithms in mesh-connected multicomputers. The convexity of a rectangle facilitates simple and efficient ways to route messages around fault regions using relatively few 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. Therefore, it is important to define a fault region that is convex, and at the same time, to include a minimum number of nonfaulty nodes. In this paper, we propose a simple and efficient distributed algorithm that can quickly construct a set of special convex polygons, called orthogonal convex polygons, from a given set of rectangular faulty blocks in a 2-D mesh (or 2-D torus). The formation of orthogonal convex polygons is done through a labeling scheme based on iterative message exchanges among neighboring nodes. For a given faulty block, after some nonfaulty nodes have been removed, the block is split into a set of orthogonal convex polygons, each of which is the smallest orthogonal convex polygon that contains all the faults it covers. Moreover, we show that the number of nonfaulty nodes covered in these polygons is no more than the one in the smallest orthogonal convex polygon that includes all the faulty nodes in the original faulty block. Finally, we discuss one open problem and present extensions to multidimensional meshes.