DocumentCode
2135673
Title
Bitonic sorting on Benesˇ networks
Author
Gocal, Beverly M. ; Batcher, Kenneth E.
Author_Institution
Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA
fYear
1996
fDate
15-19 Apr 1996
Firstpage
749
Lastpage
753
Abstract
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
Keywords
diagrams; hypercube networks; logic; network routing; parallel algorithms; sorting; Benes networks; Knuth diagrams; address line logic; bitonic sorting networks; fired data routings; Computer science; Data mining; Graphics; Joining processes; Logic; Mathematics; Routing; Sorting; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Conference_Location
Honolulu, HI
Print_ISBN
0-8186-7255-2
Type
conf
DOI
10.1109/IPPS.1996.508142
Filename
508142
Link To Document