DocumentCode :
1016588
Title :
K-way bitonic sort
Author :
Nakatani, Toshio ; Huang, Shing-Tsaan ; Arden, Bruce W. ; Tripathi, Satish K.
Author_Institution :
Dept. of Comput. Sci., Princeton Univ., NJ, USA
Volume :
38
Issue :
2
fYear :
1989
Firstpage :
283
Lastpage :
288
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.<>
Keywords :
sorting; k-way bitonic sort algorithm; k-way decomposition; Sorting;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.16506
Filename :
16506
Link To Document :
بازگشت