A fault-tolerant two-dimensional sorting network

The authors evaluate a class of sorting algorithms which can be adapted to a faulty network with nearest neighbor interconnections by determining a suitable indexing scheme. A worst case sorting time of O(N) is proved for these sorters. Simulation results show that the average sorting time of the fault-tolerant sorters is only slightly higher than O( square root N), and therefore is comparable to that of non-fault-tolerant sorting algorithms. This algorithmic approach does not require additional wiring for reconfiguration, and hence the amount of additional circuitry required for fault-tolerance is very small. An efficient procedure for calculating an indexing scheme is presented and simulation results are shown. Furthermore, an efficient strategy for testing the network is proposed.<<ETX>>

[1]  I. V. Ramakrishnan,et al.  Fault-tolerant VLSI sorters , 1987 .

[2]  Larry Rudolph,et al.  A Robust Sorting Network , 1985, IEEE Transactions on Computers.

[3]  Frank Thomson Leighton,et al.  Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.

[4]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[5]  J. G. Krammer.  Parallel processing with a sorting network , 1990, IEEE International Symposium on Circuits and Systems.

[6]  Franco P. Preparata,et al.  A Minimum Area VLSI Network for O(log n) Time Sorting , 1985, IEEE Transactions on Computers.

[7]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[8]  Thompson.  The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.

[9]  U. Schwiegelshohn.  A shortperiodic two-dimensional systolic sorting algorithm , 1988, [1988] Proceedings. International Conference on Systolic Arrays.

[10]  J. Krammer,et al.  Architecture of a two-dimensional sorting algorithm , 1990 .

[11]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[12]  R.C. Aubusson,et al.  Wafer-scale integration-a fault-tolerant procedure , 1978, IEEE Journal of Solid-State Circuits.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  W.R. Moore,et al.  A review of fault-tolerant techniques for the enhancement of integrated circuit yield , 1986, Proceedings of the IEEE.