Parallel Binary Sorter

Parallel Binary Sorter is a MPI(Message Passing Interface) implementation of parallel radix sorting. Unlike conventional sorters this sorter does make any assumptions about the keys and directly works on the underlying binary representation. This parallel sorter exhibits extreme scalability. The sorter was benchmarked on a SGI-Altix machine and it consistently exhibited speedups as increase the processors from 2,4,8 to 32. Currently the sorter is capable of sorting around 512million 16-byte keys in few minutes.

This program is very simple to use, the essential input for the program is a binary file with keys, size of the keys. The program will then generate a new binary file with sorted keys.