Fault Tolerant Sorting Networks

DOI10.1137/0404042MaRDI QIDQ3985534zbMATH OpenOpenAlexFDO

Authors Shay Assaf, Eli Upfal

Publication date 27 June 1992

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0404042

zbMATH Keywords

fault tolerant computingsorting networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• On Fault-Tolerant Networks for Sorting
• Depth Optimal Sorting Networks Resistant to k Passive Faults
• scientific article; zbMATH DE number 871920
• scientific article; zbMATH DE number 1256743

Cited in

(19)

• Sorting and searching in faulty memories
• The price of resiliency: a case study on sorting with memory faults
• Optimal resilient sorting and searching in the presence of memory faults
• Braking the (n^ 2 n) barrier for sorting with faults
• On the design of reliable Boolean circuits that contain partially unreliable gates
• Sorting by swaps with noisy comparisons
• The fault tolerance of \(( n , k )\)-bubble-sort networks
• A generalized fault-tolerant sorting algorithm on product network
• A generalized fault-tolerant sorting algorithm on product network
• A Robust Sorting Network
• On Fault-Tolerant Networks for Sorting
• Fault tolerance in a class of sorting networks
• Designing reliable algorithms in unreliable memories
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• Locating errors in faulty formulas
• Reliable minimum finding comparator networks
• Resilient dynamic programming
• Searching games with errors -- fifty years of coping with liars
• Reliable computations on faulty EREW PRAM

This page was built for publication: Fault Tolerant Sorting Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985534)