Abstract:
The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algorithm (1968), is presented. This variation of the algorithm is based on a k-way deco...Show MoreMetadata
First Page of the Article

Abstract:
The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algorithm (1968), is presented. This variation of the algorithm is based on a k-way decomposition instead of a two-way decomposition. It is proven that Batcher's bitonic sequence decomposition theorem still holds with this multiway decomposition. This leads to applications of sorting networks with bitonic sorters of arbitrary or mixed sizes.<>
Published in: IEEE Transactions on Computers ( Volume: 38, Issue: 2, February 1989)
DOI: 10.1109/12.16506
First Page of the Article
