In this paper, we propose an efficient scheme for identifying maximum size fault-free submeshes in a faulty torus-connected multicomputer system. For this, the ...

Bibliographic details on Fault-Free Maximal Submeshes in Faulty Torus-Connected Multicomputers.

The proposed approach is based on manipulating set expressions, with the search space reduced considerably by taking advantage of the interesting properties ...

This paper proposes an efficient approach for identifying all the maximum healthy submeshes present in a faulty torus/mesh. The proposed approach is based on ...

Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower ...

This paper concerns the problem of finding efficient task allocation algorithms in mesh structures. An allocation algorithm, called Window-Based-Best-Fit ...

Jun 28, 1991 · Fault-free maximal submeshes in faulty torus-connected multicomputers. 2004, Informatica (Ljubljana). Fast and efficient submesh determination ...

the fault-free nodes in the submeshes which have no subgraphs. Then, we can obtain a. Hamiltonian cycle in the torus by merging the subgraphs. We leave the ...

This paper concerns the problem of finding efficient task allocation algorithms in mesh structures. An allocation algorithm, called Window-Based-Best-Fit ...

We propose a deterministic fault-tolerant and deadlock-free routing protocol in 2-dimensional. (2-D) meshes based on dimension-order routing and the ...