论文信息 - Constructing Sorting Networks from k-Sorters

Constructing Sorting Networks from k-Sorters

We study the problem of using sorters of k values to form large sorting and merging networks. For n an integral power of k, we show how to merge k sorted vectors of length nk each using 4logkn-3 layers of k-sorters and 4logk n-5 layers of k-input binary mergers. As a result, we show how to sort n values using 2log2kn-logkn layers of k-sorters and 2log2kn-3logkn+1 layers of k-input binary mergers.

Ian Parberry | Bruce Parker

[1] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[2] Franco P. Preparata,et al. A minimum area VLSI network for O(logn) time sorting , 1984, STOC '84.

[3] David C. Van Voorhis. A lower bound for sorting networks that use the divide-sort-merge strategy , 1971 .

[4] Richard M. Karp,et al. A Phenomenon in the Theory of Sorting , 1970, SWAT.

[5] Frank H. Young,et al. Improved Divide/Sort/Merge Sorting Networks , 1975, SIAM J. Comput..

[6] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.

[7] David C. van Voorhis. An economical construction for sorting networks , 1974, AFIPS '74.

[8] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[9] Franco P. Preparata,et al. A Minimum Area VLSI Network for O(log n) Time Sorting , 1985, IEEE Transactions on Computers.