A multiway merging network
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.
KeywordsSorting Network Nondecreasing Order Positive Infinity Minimum Time Delay Iterative Rule
Unable to display preview. Download preview PDF.
- 1.Batcher, E., K.: Sorting Networks and Their Applications. AFIPS Proc. Spring Joint Computer Conf. (1968) 307–314Google Scholar
- 2.Batcher, E., K.: On Bitonic Sorting Networks. Proc. 19th Int'l Conf. on Parallel Processing (1990) 376–379Google Scholar
- 3.Knuth, E., D.: Sorting and Searching. The art of Computer Programming. Addison-Wesley. 3 (1973)Google Scholar