This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reliable Distributed Sorting Through the Application-Oriented Fault Tolerance Paradigm
July 1992 (vol. 3 no. 4)
pp. 411-420
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.

[1] W. Athas and C. Seitz, "Multicomputers: Message-passing concurrent computers,"IEEE Comput. Mag., pp. 9-25, Aug. 1988.
[2] K. Batcher, "Sorting networks and their applications," inProc. 1968 Spring Joint Comput. Conf., vol. 32. Reston, VA: AFIPS Press, pp. 307-314.
[3] S. Even,Graph Algorithms. Rockville, MD: Computer Science Press, p. 212.
[4] J. Jou and J. Abraham, "Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures,"Proc. IEEE, pp. 732-741, May 1986.
[5] L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem,"ACM Trans. Programming Languages and Systems, Vol. 4, No. 3, July 1982, pp. 382-401.
[6] B. McMillin and L. Ni, "A reliable parallel algorithm for relaxation labeling," inParallel Processing for Computer Vision and Display, P. M. Dew, R. A. Earnshaw, and T. R. Heywood, Eds. Reading, MA: Addison-Wesley, 1989, pp. 190-209.
[7] B. McMillin and L. Ni, "Executable assertion development for the distributed parallel environment," inProc. 12th Int. COMPSAC, Chicago, IL, Oct. 1988, pp. 284-291.
[8] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[9] L. Stucki, "New directions in automated tools for improving software quality," inCurrent Trends in Programming Methodology, Vol. 2., R.T. Yeh, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1977, pp. 80-111.

Index Terms:
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
Citation:
B.M. McMillin, L.M. Ni, "Reliable Distributed Sorting Through the Application-Oriented Fault Tolerance Paradigm," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 411-420, July 1992, doi:10.1109/71.149960
Usage of this product signifies your acceptance of the Terms of Use.