A Robust Sorting Network

DOI10.1109/TC.1985.5009383zbMath0556.68021OpenAlexW2087711310MaRDI QIDQ3219771

Larry Rudolph

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.5009383

zbMATH Keywords

parallel processingVLSIsorting networksfault-tolerant computingshuffle-exchangerecirculating networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items

Efficient parallel algorithms can be made robust ⋮ Better understanding of Batcher's merging networks ⋮ Periodic comparator networks