This is an example implementation of a distributed bitonic sorting algorithm in C++ using OpenMPI, it has not been optimized for speed but is instead meant to be an example of how bitonic sort works.
- Runs on OpenMPI CPU clusters (requires boost-mpi)
- Node partners are calculated using a hyper-cube
- Video of the program sorting 16,000,000 random nubmers https://www.youtube.com/watch?v=C1YBOE60Hwo
Use Eclipse project files.
Copyright (C) 2012 Moloch
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://www.gnu.org/licenses/>.