Fault Tolerant Sorting Networks
- 1 November 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 4 (4) , 472-480
- https://doi.org/10.1137/0404042
Abstract
A general technique for enhancing the reliability of sorting networks and other comparator-based networks is presented. The technique converts any network that uses unreliable comparators to a fault-tolerant network that produces the correct output with overwhelming probability, even if each comparator is faulty with some probability smaller than 1/2, independently of other comparators. The depth of the fault-tolerant network is only a constant times the depth of the original network, and the width of the network is increased by a logarithmic factor.Keywords
This publication has 8 references indexed in Scilit:
- A correction network for N-sortersPublished by Springer Nature ,2006
- Eigenvalues and expandersCombinatorica, 1986
- A Robust Sorting NetworkIEEE Transactions on Computers, 1985
- On Fault-Tolerant Networks for SortingSIAM Journal on Computing, 1985
- Sorting inc logn parallel stepsCombinatorica, 1983
- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable ComponentsPublished by Walter de Gruyter GmbH ,1956
- Reliable circuits using less reliable relaysJournal of the Franklin Institute, 1956
- Reliable circuits using less reliable relaysJournal of the Franklin Institute, 1956