Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems
| Hi-index | 0.00 |
The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches.