A Multiway Merge Sorting Network

  • Authors:
  • De-Lei Lee;Kenneth E. Batcher

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

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 $m\ k$-way mergers and a combining network. It arranges $k$ ordered lists of length $n$ each into one ordered lists in $T(k) + \lceil \log_m n\rceil \lceil \log_2 k\rceil \lceil \log_2 m\rceil$ steps, where $T(k)$ is the number of steps needed to sort $k$ keys in order; and $k$ and $m$ are any integers no longer restricted to 2.Index Terms驴Sorting networks, odd-even merge, multiway merge, parallel processing.