Fault Tolerance in a Class of Sorting Networks

IEEE Transactions on Computers

Volumn 43, Issue 7, 1994, Pages 827-837

  Sun, Jianli ^a   Cerny, Eduard ^b   Gecsei, Jan ^b  

^a Proocol Standards and Communications Inc ^*  (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

fault tolerant computing; parallel processing; perfect shuffle; recirculation networks; Sorting networks

Indexed keywords

COMPUTER ARCHITECTURE; CRITICAL PATH ANALYSIS; ERROR ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES; REDUNDANCY; SORTING; SYSTEMS ANALYSIS;

FAULT TOLERANCE; PERFECT SHUFFLE; RECIRCULATION NETWORKS; SORTING NETWORKS; SYSTOLIC PRIORITY QUEUE;

COMPUTER NETWORKS;

EID: 0028467246     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.293261     Document Type: Article

References (21)

1. L. Rudolph, “A robust sorting network,” IEEE Trans. Comput. (Special issue on sorting), vol. C-34, no. 4, pp. 326-335, Apr. 1985.
2. K. E. Batcher, “Sorting networks and their applications,” in Proc. AFIP Spring Joint Comput. Conf., 1968, pp. 307-314.
3. M. Dowd, Y. Perl, L. Rudolph, and M. Saks, “The balanced sorting network,” in Proc. ACM Princ. Distrib. Comput., Aug. 1983, pp. 161-172.
4. H. S. Stone, “Parallel processing with perfect shuffle,” IEEE Trans. Comput., vol. C-20, no. 2, pp. 153-161, Feb. 1971.
5. F. P. Preparata and J. Vuillemin, “The cube-connected cycle: a versatile network for parallel computation,” Commun. ACM, vol. 24, no. 5, pp. 300-309, 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. 642-667, Mar. 1982.
7. D. E. Knuth, The Art of Computer Programming. Reading, MA: Addison-Wesley, 1973, vol. 3.
8. C. D. Thompson, “The VLSI complexity of sorting,” IEEE Trans. Comput., vol. C-32, no. 12, pp. 1171-1184, Dec. 1983.
9. C. E. Leiserson, “Systolic priority queues,” Proc. Cal Tech Conf. VLSI, Jan. 1979, pp. 199-224.
10. S. G. Akl, Parallel Sorting Algorithms. New York: Academic Press, 1985.
11. T. Y. Feng and C. L. Wu, “Fault-diagnosis for a class of multistage interconnection networks,” IEEE Trans. Comput., vol. C-30, no. 10, pp. 743-758, Oct. 1981.
12. J. Sun, J. Gecsei, and E. Cerny, “Fault-tolerance in balanced sorting networks,” J. Electronic Testing: Theory and Applications, vol. 1, no. 1, pp. 31-41, 1990.
13. J. Sun, E. Cerny, and J. Gecsei, “A robust sorting network for yield improvement,” in Proc. 1990 IF1P-IEEE Int. Workshop on Defect and Fault-tolerance in VLSI Sys., Grenoble, France, 1990, pp. 217-227.
14. J. Sun and J. Gecsei, “A multiple-fault tolerant sorting network,” in Dig. Fault-Tolerant Computing: 21st Int. Symp., June 1991, pp. 274-281.
15. Y. Choi and M. Malek, “A fault-tolerant systolic sorter,” IEEE Trans. Comput., vol. 37, no. 5, pp. 621-624, May 1988.
16. S. Liang and S. Kuo, “Concurrent error detection and correction in realtime systolic sorting arrays,” in Dig. Fault-Tolerant Computing: 20th Int. Symp., June 1990, pp. 434-441.
17. G. Bilardi, “Merging and sorting networks with the topology of the Omega networks,” IEEE Trans. Comput., vol. 38, no. 10, pp. 1396-1403, Oct. 1989.
18. A. C. Yao and F. F. Yao, “On fault-tolerant networks for sorting,” SIAM J. Comput., vol. 14, no. 1, pp. 120-128, 1985.
19. S. Assaf and E. Upfal, “Fault-tolerant sorting network,” in Proc. of 31st Annu. Symp. Foundations of Comput. Sci., Oct. 1990, pp. 275-284.
20. T. Leighton, Y. Ma, and C. G. Plaxton, “Highly fault-tolerant sorting circuits,” in Proc. 32nd Annu. Symp. Foundaions of Comput. Sci., 1991, pp. 458-469.
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. 567-581, Apr. 1989.