Skip to main content

A multiway merging network

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1994)

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

Included in the following conference series:

  • 145 Accesses

Abstract

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)+[logm n] [log2 k] [log2 m] 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Batcher, E., K.: Sorting Networks and Their Applications. AFIPS Proc. Spring Joint Computer Conf. (1968) 307–314

    Google Scholar 

  2. Batcher, E., K.: On Bitonic Sorting Networks. Proc. 19th Int'l Conf. on Parallel Processing (1990) 376–379

    Google Scholar 

  3. Knuth, E., D.: Sorting and Searching. The art of Computer Programming. Addison-Wesley. 3 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, DL., Batcher, K.E. (1994). A multiway merging network. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_233

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_233

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics