Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Introduction to Algorithms
| Hi-index | 0.00 |
This paper presents Software Implemented Fault Tolerance (SIFT) for hypercubes which is implemented by means of a software layer. It is written in each node of the nCube parallel computer. The SIFT utilizes an error detection application software and fast reconfiguration algorithm for avoiding faulty nodes. The Balance Spanning Tree (BST) is used for embedding tree-based algorithms into the hypercube topology. Any single faulty node in the hypercube can be tolerated by the software layer. More than 90% of the multiple faults can be tolerated without backtracking. The SIFT approach has been successfully implemented for a quadtree data compression algorithm for 64脳64, 128脳128 compressible and uncompressible data. The experiments were run on 4 and 16 node nCubes. The time overhead (reconfiguration and recomputation time) incurred by the injected fault was experimentally estimated. The coverage factor, provided by the error-detection software, has been estimated by means of nSOFIT for the quadtree data compression algorithm.