A bitonic sorting network with simpler flip interconnections
暂无分享,去创建一个
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.
[1] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[2] Kenneth E. Batcher. On Bitonic Sorting Networks , 1990, ICPP.
[3] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.