Fault Tolerant Computing: An Improved Recursive Algorithm
Wanlei Zhou · 2005
In this paper, an improved recursive algorithm for fault tolerant computing is described. The original algorithm is presented by P. Agrawal. The improved algorithm uses majority voting to achieve more believable results than that of the original algorithm. Both space and time redundancy are employed dynamically in the algorithm. The algorithm is also extended to a general form. By defining different parameters, the algorithm will suit different system situations. The improved algorithm also has the original algorithm as one of its special cases. The performance of the improved algorithm is compared with the original algorithm by simulation. The results show that the improved algorithm is suitable for many circumstances.