A multiway merging network

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)


A multiway merging network is presented, which allows more flexible construction of parallel sorting networks. The merging network described here is composed of m k-way mergers and a combining network. It arranges k ordered lists each of length n into one ordered list in T(k)+[logmn] [log2k] [log2m] 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.


Sorting Network Nondecreasing Order Positive Infinity Minimum Time Delay Iterative Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Batcher, E., K.: Sorting Networks and Their Applications. AFIPS Proc. Spring Joint Computer Conf. (1968) 307–314Google Scholar
  2. 2.
    Batcher, E., K.: On Bitonic Sorting Networks. Proc. 19th Int'l Conf. on Parallel Processing (1990) 376–379Google Scholar
  3. 3.
    Knuth, E., D.: Sorting and Searching. The art of Computer Programming. Addison-Wesley. 3 (1973)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  1. 1.Department of Computer ScienceYork UniversityNorth YorkCanada
  2. 2.Department of Mathematics and Computer ScienceKent State UniversityKentUSA

Personalised recommendations