Title :
A multiway merge sorting network
Author :
Lee, De-lei ; Batcher, Kenneth E.
Author_Institution :
Dept. of Comput. Sci., York Univ., North York, Ont., Canada
fDate :
2/1/1995 12:00:00 AM
Abstract :
A multiway merge sorting network is presented, which generalizes the technique used in the odd-even merge sorting network. The merging network described here is composed of m k-way mergers and a combining network. It arranges k ordered lists of length n each into one ordered lists in T(k)+[log2k] [log2m] [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
Keywords :
merging; sorting; multiway merge sorting network; odd-even merge sorting network; Computer science; Corporate acquisitions; Councils; Delay effects; Mathematics; Merging; Parallel processing; Sorting;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
