DocumentCode
2779202
Title
Fault tolerant sorting network
Author
Assaf, Shay ; Upfal, Eli
Author_Institution
Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel
fYear
1990
fDate
22-24 Oct 1990
Firstpage
275
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
fault tolerant computing; sorting; comparator-based networks; fault tolerant sorting network; logarithmic factor; reliability enhancement; Algorithm design and analysis; Career development; Computer networks; Fault tolerance; Large-scale systems; Mathematics; Merging; Registers; Sorting; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location
St. Louis, MO
Print_ISBN
0-8186-2082-X
Type
conf
DOI
10.1109/FSCS.1990.89546
Filename
89546
Link To Document