
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jianli Sun, E. Cerny, J. Gecsei, "Fault Tolerance in a Class of Sorting Networks," IEEE Transactions on Computers, vol. 43, no. 7, pp. 827837, July, 1994.  
BibTex  x  
@article{ 10.1109/12.293261, author = {Jianli Sun and E. Cerny and J. Gecsei}, title = {Fault Tolerance in a Class of Sorting Networks}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {7}, issn = {00189340}, year = {1994}, pages = {827837}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.293261}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fault Tolerance in a Class of Sorting Networks IS  7 SN  00189340 SP827 EP837 EPD  827837 A1  Jianli Sun, A1  E. Cerny, A1  J. Gecsei, PY  1994 KW  sorting; comparators (circuits); fault tolerant computing; reliability; parallel processing; fault tolerant computing; fault tolerance; sorting networks; singlefault tolerance; comparators; 1fault tolerant design; balanced sorting network; 2fault tolerant design; multistage network. VL  43 JA  IEEE Transactions on Computers ER   
The early study of fault tolerance in efficient sorting networks only achieved singlefault tolerance. By eliminating critical comparators, L. Rudolph (1985) presented a 1fault tolerant design of the balanced sorting network (BSN) at the cost of one redundant stage of N/2 comparators and two permuters external to the network. In this paper, we show, however, that 1fault tolerance of BSN can be achieved without introducing redundancy and external permuters. Furthermore, we provide solutions to the open question of how to achieve multiplefault tolerance in BSN. We analyze the problem from a higherlevel by introducing a new concept of critical stages, and find that all stages in previous designs are critical. A 2fault tolerant design of BSN is then discovered after eliminating its critical stages. The new design has a similar network architecture (i.e., a multistage network with the output recirculated back to the input) and the same hardware cost as Rudolph's, but it has many distinguished features. The performance analysis shows that the new designs achieve much higher probabilities of correct sorting in the presence of faulty comparators than the previous reported designs.
[1] L. Rudolph, "A robust sorting network,"IEEE Trans. Comput.(Special issue on sorting), vol. C34, no. 4, pp. 326335, Apr. 1985.
[2] K. E. Batcher, "Sorting networks and their applications," inProc. AFIP Spring Joint Comput. Conf., 1968, pp. 307314.
[3] M. Dowd, Y. Perl, L. Rudolph, and M. Saks, "The balanced sorting network," inProc. ACM Princ. Distrib. Comput., Aug. 1983, pp. 161172.
[4] H. S. Stone, "Parallel processing with perfect shuffle,"IEEE Trans. Comput., vol. C20, no. 2, pp. 153161, Feb. 1971.
[5] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[6] D. Nassimi and S. Sahni, "Parallel permutation and sorting algorithms and a new generalized connection network,"J. ACM, vol. 29, no. 3, pp. 642667, 1982.
[7] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: AddisonWesley, 1973.
[8] C. D. Thompson, "The VLSI complexity of sorting,"IEEE Trans. Comput., vol. C32, no. 12, pp. 11711184, Dec. 1983.
[9] C. E. Leiserson, "Systolic priority queues,"Proc. CalTech Conf. VLSI, Jan. 1979, pp. 199224.
[10] S. G. Akl,Parallel Sorting Algorithms. Orlando, FL: Academic, 1985.
[11] T. Y. Feng and C. L. Wu, "Faultdiagnosis for a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C30, no. 10, pp. 743758, Oct. 1981.
[12] J. Sun, J. Gecsei, and E. Cerny, "Faulttolerance in balanced sorting networks,"J. Electron. Testing: Theory and Appl., pp. 3141, 1990.
[13] J. Sun, E. Cerny, and J. Gecsei, "A robust sorting network for yield improvement," inProc. 1990 IFIPIEEE Int. Workshop on Defect and Faulttolerance in VLSI Sys., Grenoble, France, 1990, pp. 217227.
[14] J. Sun and J. Gecsei, "A multiplefault tolerant sorting network," inDig. FaultTolerant Computing: 21st Int. Symp., June 1991, pp. 274281.
[15] Y. Choi and M. Malek, "A faulttolerant systolic sorter,"IEEE Trans. Comput., vol. 37, no. 5, pp. 621624, May 1988.
[16] S. Liang and S. Kuo, "Concurrent error detection and correction in realtime systolic sorting arrays," inDig. FaultTolerant Computing: 20th Int. Symp., June 1990, pp. 434441.
[17] G. Bilardi, "Merging and sorting networks with the topology of the Omega networks,"IEEE Trans. Comput., vol. 38, no. 10, pp. 13961403, Oct. 1989.
[18] A. C. Yao and F. F. Yao, "On faulttolerant networks for sorting,"SIAM J. Comput., vol. 14, no. 1, pp. 120128, 1985.
[19] S. Assaf and E. Upfal, "Faulttolerant sorting network," inProc. of 31st Annu. Symp. Foundations of Comput. Sci., Oct. 1990, pp. 275284.
[20] T. Leighton, Y. Ma, and C. G. Plaxton, "Highly faulttolerant sorting circuits," inProc. 32nd Annu. Symp. Foundations of Comput. Sci., 1991, pp. 458469.
[21] M. R. Samatham and D. K. Pradhan, "The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI,"IEEE Trans. Comput., vol. 38, no. 4, pp. 567581, Apr. 1989.