Bitonic Sort on Hypercube
Sort distributed keys across hypercube processors using dimension based compare and exchange stages.
6 notes
Sort distributed keys across hypercube processors using dimension based compare and exchange stages.
Sort a fixed size sequence with a bitonic compare and exchange network whose schedule is independent of input values.
Sort small vectors using SIMD registers with a fixed bitonic compare exchange network.
Sort data on a GPU using a regular bitonic compare and exchange network.
Sort data by building and merging bitonic sequences through a regular compare and exchange network.
Comparison sorting algorithm that sorts a bitonic sequence using structured compare and swap operations.