A correction network for N-sorters
SIAM Journal on Computing
The periodic balanced sorting network
Journal of the ACM (JACM)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized algorithms
An O(nlogn)-size fault-tolerant sorting network (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Breaking the &thgr;(nlog2n) barrier for sorting with faults
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Depth optimal sorting networks resistant to k passive faults
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
A note on constructing binary heaps with periodic networks
Information Processing Letters
Fast periodic correction networks
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
| Hi-index | 0.00 |
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changing values of s, 0 s ⪇ N, keys at unknown positions. Such s-disturbed sequences can appear as outputs of a sorting network that contains faulty comparators. We present a simple comparator network of depth 4 that sorts 1-disturbed sequences in logarithmic time, where the network is used repeatedly, i.e. if its output is not sorted, the network is run again taking the output as input. Then we analyze the passive-fault model of comparator networks introduced by Yao and Yao, where a faulty comparator outputs directly its input without making a comparison. In this context, we give a construction of N-input, f-fault-tolerant comparator networks of depth 6 that sort 1-disturbed sequences in time &Ogr;(logN + f). Finally, we prove that choosing f = &Ogr;(logN) one can make such networks random-fault-tolerant. In the last two results the constructions and their analysis are simpler as the previous non-periodic ones, and still their runtimes are asymptotically optimal.