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 that 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
Published in:
Parallel and Distributed Systems, IEEE Transactions on
(Volume:3
,
Issue:
4
)
Date of Publication:
Jul 1992
- Page(s):
-
411
-
420
- ISSN :
-
1045-9219
- INSPEC Accession Number:
-
4258227
- Digital Object Identifier :
-
10.1109/71.149960
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Jul 1992
- Sponsored by :
-
IEEE Computer Society