Issue No.04 - July (1992 vol.3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.149960
A fault-tolerant parallel sorting algorithm developed using the application-oriented fault tolerance paradigm is presented. The algorithm is tolerant of one processor/link failure in an n-cube. The addition of reliability to the sorting algorithm results in a performance penalty. Asymptotically, the fault-tolerant algorithm is less costly than host sorting.Experimentally it is shown that fault-tolerant sorting quickly becomes more efficient than host sorting when the bitonic sort/merge is considered. The main contribution is the demonstration that the application-oriented fault tolerance paradigm is applicable to problems of a noniterative-convergent nature.
Index Termsreliable distributed sorting; noniterative convergence; application-oriented faulttolerance; fault-tolerant parallel sorting algorithm; processor/link failure; n-cube;performance penalty; host sorting; bitonic sort/merge; fault tolerant computing; parallelalgorithms; parallel programming; programming theory; sorting
B.M. McMillin, L.M. Ni, "Reliable Distributed Sorting Through the Application-Oriented Fault Tolerance Paradigm", IEEE Transactions on Parallel & Distributed Systems, vol.3, no. 4, pp. 411-420, July 1992, doi:10.1109/71.149960