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.
Preview
Unable to display preview. Download preview PDF.
References
Batcher, E., K.: Sorting Networks and Their Applications. AFIPS Proc. Spring Joint Computer Conf. (1968) 307–314
Batcher, E., K.: On Bitonic Sorting Networks. Proc. 19th Int'l Conf. on Parallel Processing (1990) 376–379
Knuth, E., D.: Sorting and Searching. The art of Computer Programming. Addison-Wesley. 3 (1973)
Author information
Authors and Affiliations
Editor information
Rights 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