Batcher’s Bitonic Sort

• Batcher’s bitonic sort was derived from his sorting network, and remains an effective parallel sort -- uses compare/exchange

• An easy way to think of the algorithm is as if the processors formed a hypercube

  • Compare/exchanges are performed between processors differing in the ith bit position with the higher element going to a specific processor
  • Start with LSB position
  • After compare/exchanging ith bit, sort lower bit positions

Previous slide

Next slide

Back to first slide

View graphic version