A Fault-Tolerant Systolic Sorter
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Merging and Sorting Networks with the Topology of the Omega Network
IEEE Transactions on Computers
Fault-tolerance in balanced sorting networks
Journal of Electronic Testing: Theory and Applications
Highly fault-tolerant sorting circuits
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Parallel Sorting Algorithms
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An O(nlogn)-size fault-tolerant sorting network (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
| Hi-index | 15.01 |
The early study of fault tolerance in efficient sorting networks only achieved single-fault tolerance. By eliminating critical comparators, L. Rudolph (1985) presented a 1-fault tolerant design of the balanced sorting network (BSN) at the cost of one redundant stage of N/2 comparators and two permuters external to the network. In this paper, we show, however, that 1-fault tolerance of BSN can be achieved without introducing redundancy and external permuters. Furthermore, we provide solutions to the open question of how to achieve multiple-fault tolerance in BSN. We analyze the problem from a higher-level by introducing a new concept of critical stages, and find that all stages in previous designs are critical. A 2-fault tolerant design of BSN is then discovered after eliminating its critical stages. The new design has a similar network architecture (i.e., a multistage network with the output recirculated back to the input) and the same hardware cost as Rudolph's, but it has many distinguished features. The performance analysis shows that the new designs achieve much higher probabilities of correct sorting in the presence of faulty comparators than the previous reported designs.