IEEE Transactions on Computers
A Multiway Merge Sorting Network
IEEE Transactions on Parallel and Distributed Systems
Sorting on a mesh-connected parallel computer
Communications of the ACM
A Generalized Bitonic Sorting Network
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
Bitonic sorters sort a single bitonic sequence into an ascending sequence. A multi-bitonic sorter is presented here, which sorts k bitonic sequences of n keys each into an ascending sequence in at most \left( {\left\lceil {\log _2 \left( {k + \left\lceil {\frac{k} {2}} \right\rceil } \right)} \right\rceil+ 1} \right)\left( {\left\lceil {\log _2 n} \right\rceil- 1} \right)+T(1,k)+\left\lceil {\log _2 k} \right\rceil +1 time delay, where T(1,k) is the time delay needed to sort k keys in order; and k is any integer not restricted to 1.