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) + [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.
Cite
CITATION STYLE
Lee, D. L., & Batcher, K. E. (1994). A multiway merging network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 643–651). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_233
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
