A multiway merge sorting network

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1995Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Transactions on Parallel and Distributed Systems, volume 6, pages 211-215 (issn: 1045-9219,

Copyright policy )

Authors: De-Lei Lee; Kenneth E. Batcher;

doi: 10.1109/71.342136

A multiway merge sorting network

- Summary
- Metrics

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)+[log/sub 2/k] [log/sub 2/m] [log/sub 2/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. >

Related Organizations

York University
Canada
University System of Ohio
United States
Kent State University
United States
University of York
United Kingdom

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	26
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%