An efficient algorithm-based fault detection and recovery on multiprocessor systems

Algorithm-Based Fault Tolerance (ABFT) schemes have been proposed as a means of low-cost error protection for parallel algorithms. This paper presents a modified fault tolerant scheme for matrix multiplication on multiprocessor systems. The proposed scheme increases the detectability through the use of a new partition scheme for the system´s processors. The time overhead of the modified recovery algorithm is reduced by the use of a new weight checksum code based only on shifting not multiplication. In this paper a Triple modular Redundancy (TMR) host is used which is actually a part of the multiprocessor system to avoid the need for an expensive host. Thus, the proposed system possess higher reliability at a lower overhead time and cost