By Topic

Minimizing communication of a recirculating bitonic sorting network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jae-Dong Lee ; Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA ; Batcher, K.E.

This paper presents the construction of a new recirculating bitonic sorting network which reduces the O(Nlog2N) cost complexity of the original bitonic sorting network to O(NlogN) while preserving the well known time complexity of O(log2N). Network communication is reduced by one half by leaving the N/2 even-parity keys in the local memory of each comparator

Published in:

Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on  (Volume:1 )

Date of Conference:

12-16 Aug 1996