Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
