loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96)
A bitonic sorting network with simpler flip interconnections
Beijing, CHINA
June 12-June 14
ISBN: 0-8186-7460-1
Jae-Dong Lee, Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA
K.E. Batcher, Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA
This paper presents the new scheme of interconnecting levels in a bitonic sorting network with simpler inter-level wiring. A parity technique which leads to the algorithm Construct-BSMF is introduced. Wiring simplification through the network is achieved wiring the N/2 even-parity keys straight through the network. N/2 odd-parity keys use flip interconnections. As a result, our interconnection scheme simplifies the inter-level wiring through the network and outperforms the perfect-shuffle interconnection scheme both in terms of cost and delay.
Index Terms:
sorting; multiprocessor interconnection networks; parallel architectures; parallel algorithms; flip interconnections; bitonic sorting network; inter-level wiring; parity technique; Construct-BSMF; N/2 even-parity keys; interconnection scheme; perfect-shuffle interconnection
Citation:
Jae-Dong Lee, K.E. Batcher, "A bitonic sorting network with simpler flip interconnections," ispan, pp.104, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.