The Community for Technology Leaders
Green Image
Issue No. 02 - February (1995 vol. 6)
ISSN: 1045-9219
pp: 211-215
<p><it>Abstract—</it>A multiway merge sorting network is presented, which generalizes the technique used in the odd-even merge sorting network. The merging network described here is composed of <math><tmath>$m\ k$</tmath></math>-way mergers and a combining network. It arranges <math><tmath>$k$</tmath></math> ordered lists of length <math><tmath>$n$</tmath></math> each into one ordered lists in <math><tmath>$T(k) + \lceil \log_m n\rceil \lceil \log_2 k\rceil \lceil \log_2 m\rceil$</tmath></math> steps, where <math><tmath>$T(k)$</tmath></math> is the number of steps needed to sort <math><tmath>$k$</tmath></math> keys in order; and <math><tmath>$k$</tmath></math> and <math><tmath>$m$</tmath></math> are any integers no longer restricted to 2.</p><p><it>Index Terms—</it>Sorting networks, odd-even merge, multiway merge, parallel processing.</p>

D. Lee and K. E. Batcher, "A Multiway Merge Sorting Network," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 211-215, 1995.
82 ms
(Ver 3.3 (11022016))