An inherently fault tolerant sorting algorithm

The paper defines inherent fault tolerance and illustrates this approach by developing an inherently fault tolerant parallel sorting algorithm. In particular, it shows, how the algorithm can be developed systematically in four steps, namely, by starting with a conventional algorithm, extending it to an infinite iterative algorithm, incorporating inherent fault tolerance, and improving the performance. This inherently fault tolerant sorting algorithm sorts the input sequence of size N using N/2 processors in O(log/sup 2/N) time if there is no processor failure and sorts in O(2/sup (log(f+1))/log/sup 2/N), time if f processors have failed.<
>