By Topic

Bitonic sorting on Benesˇ networks

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)
Gocal, B.M. ; Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA ; Batcher, K.E.

An algorithm to sort via a Benesˇ network is derived from the logic of the fired data routings found in bitonic sorting networks. The appropriate routings are developed and presented using an expanded version of Knuth diagrams for sorting networks. These diagrams illustrate the address line logic within the network

Published in:

Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

Date of Conference:

15-19 Apr 1996