Abstract
To increase the reliability of networks embedded in meshes or tori and to allow their use in the presence of faulty nodes, efficient fault-tolerant schemes in meshes and tort are necessary. In this paper, we present algorithms for embedding a ring in a mesh-type and torus-type multiprocessor network in the event of node failures. In our approach, a mesh or torus is partitioned into 4×4 submeshes. Subgraphs (rings and linear arrays) are mapped in each submesh and then merged to form a large ring. Using this approach, we obtain the following results in a torus. Given any f ≤ 2 faulty nodes, a ring which is optimal can be found in a mesh. Also, given any f ≤ 4 faulty nodes, a ring which is optimal can be found in a torus. Furthermore, given f ≤ 4 faulty nodes, a Hamiltonian cycle can be found in a torus if and only if the number of even faulty nodes is equal to the number of odd faulty nodes. Even and odd refer to the sum of the node's coordinates.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
