Skip to content

HykSort in C implementation. A SampleSort variant that uses alltoallv_kway and Parallel select having as a result reduced complexity to O(N log p / log k)

License

Notifications You must be signed in to change notification settings

XarisA/HykSortInC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

HykSortInC

HykSort in C implementation. A SampleSort variant that uses alltoallv_kway and Parallel select having as a result reduced complexity to O(N log p / log k)

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. Distributed Bitonic Sort using MPI : https://github.com/steremma/Bitonic

License

GNU GENERAL PUBLIC LICENSE (Version 3, 29 June 2007)

Copyright (c) 2021 Harris Arvanitis

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http:https://www.gnu.org/licenses/.

About

HykSort in C implementation. A SampleSort variant that uses alltoallv_kway and Parallel select having as a result reduced complexity to O(N log p / log k)

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages