Bitonic Sort on Hypercube
Bitonic Sort on Hypercube Bitonic sort on a hypercube maps the bitonic sorting network onto processors connected as a hypercube. Each processor communicates with neighbors that differ in one binary address bit. The fixed communication pattern matches the regular compare and exchange stages of bitonic sort. This model is useful for parallel sorting theory and for systems whose communication topology resembles a hypercube. Problem Given $n$ keys distributed across $p...