A Partitioning Approach to the Design of Selection Networks

null Benjamin W. Wah; null Kuo-Liang Chen

doi:10.1109/TC.1984.1676423

Publication
1984
Issue No. 3 - March
Abstract - A Partitioning Approach to the Design of Selection Networks

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by null Benjamin W. Wah Articles by null Kuo-Liang Chen

A Partitioning Approach to the Design of Selection Networks

March 1984 (vol. 33 no. 3)

pp. 261-268

	ASCII Text	x
	null Benjamin W. Wah, null Kuo-Liang Chen, "A Partitioning Approach to the Design of Selection Networks," IEEE Transactions on Computers, vol. 33, no. 3, pp. 261-268, March, 1984.

	BibTex	x
	@article{ 10.1109/TC.1984.1676423, author = {null Benjamin W. Wah and null Kuo-Liang Chen}, title = {A Partitioning Approach to the Design of Selection Networks}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {3}, issn = {0018-9340}, year = {1984}, pages = {261-268}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676423}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - A Partitioning Approach to the Design of Selection Networks IS - 3 SN - 0018-9340 SP261 EP268 EPD - 261-268 A1 - null Benjamin W. Wah, A1 - null Kuo-Liang Chen, PY - 1984 KW - selection KW - Bitonic merging network KW - comparison-exchange module KW - odd-even sorting network KW - partitioning KW - scheduling VL - 33 JA - IEEE Transactions on Computers ER -

null Benjamin W. Wah, School of Electrical Engineering, Purdue University

null Kuo-Liang Chen

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676423

The (m,n) selection problem is defined as the selection of the m smallest numbers in any order from a set of n numbers (m =n). In this paper, we have proposed a class of design procedures for selection networks based on partitioning. Conditions are defined so that the optimal design can be found in polynomial time. The resulting selection network has O([log2n] ? [log2m]) time

Index Terms:

selection, Bitonic merging network, comparison-exchange module, odd-even sorting network, partitioning, scheduling

Citation:

null Benjamin W. Wah, null Kuo-Liang Chen, "A Partitioning Approach to the Design of Selection Networks," IEEE Transactions on Computers, vol. 33, no. 3, pp. 261-268, March 1984, doi:10.1109/TC.1984.1676423

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.