/HykSort

HykSort Algorithm Implementation with Parallel Select for splitters. Testing and performance.

Primary LanguageC++MIT LicenseMIT

HykSort

HykSort Algorithm Implementation with ParallelSelect algorithm for finding splitters and AlltoAll_kway for all to all communication between processors, having as a result reduced complexity to O(N log p / log k).

Most part of the code used in this project is forked from [2] and have changed accordingly. I added some helper functions and distinguished the HykSort algorithm from [2] so that it can run independenly.

References

  1. Hari Sundar, Dhairya Malhotra, George Biros, HykSort: a new variant of hypercube quicksort on distributed memory architectures, Proceedings of the 27th international ACM conference on international conference on supercomputing (ICS13), 2013.

  2. Utah Sorting Librrary : https://github.com/hsundar/usort

  3. Distributed Bitonic Sort using MPI : https://github.com/steremma/Bitonic