Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Sorting n Objects with a k-Sorter
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An optimal sorting algorithm on reconfigurable mesh
Journal of Parallel and Distributed Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
How to Sort N Items Using a Sorting Network of Fixed I/O Size
IEEE Transactions on Parallel and Distributed Systems
Codesign-extended applications
Proceedings of the tenth international symposium on Hardware/software codesign
Classifying Matrices Separating Rows and Columns
IEEE Transactions on Parallel and Distributed Systems
A scalable VLSI speed/area tunable sorting network
Journal of Systems Architecture: the EUROMICRO Journal
An ASIC design and formal analysis of a novel pipelined and parallel sorting accelerator
Integration, the VLSI Journal
A robust channel estimator for high-mobility STBC-OFDM systems
IEEE Transactions on Circuits and Systems Part I: Regular Papers
STBC-OFDM downlink baseband receiver for mobile WMAN
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 14.98 |
We present a hardware-algorithm for sorting $N$ elements using either a p-sorter or a sorting network of fixed I/O size $p$ while strictly enforcing conflict-free memory accesses. To the best of our knowledge, this is the first realistic design that achieves optimal time performance, running in $\Theta ( {\frac{N \log N}{p \log p}})$ time for all ranges of $N$. Our result completely resolves the problem of designing an implementable, time-optimal algorithm for sorting $N$ elements using a p-sorter. More importantly, however, our result shows that, in order to achieve optimal time performance, all that is needed is a sorting network of depth $O(\log^2 p)$ such as, for example, Batcher's classic bitonic sorting network.