Parallel sorting by exact splitting

A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using a flexible locating splitter algorithm. The time complexity and communication cost is pretty good compared with other con-generic algorithms, and could even be better in particular situations benefitting from the flexibility of its locating splitter algorithm. In addition, experimental results of the algorithm under an MPI environment on LANs are given and compared with those of the PSRS algorithm. According to the theoretical analysis and experimental results, the algorithm is preferable due to its virtues of high efficiency, scalability, low communication cost and good load balancing.