Abstract
A new parallel sorting algorithm, Parasort, based upon Quicksort and two-way merging and suitable for implementation on shared memory multiprocessors is presented. An asynchronous parallel partitioning algorithm is used to distribute the work evenly amongst the processors during merging to ensure an even load balance which is crucial if high efficiency is to be achieved. The implementation of this parallel sorting algorithm on the Balance 8000 multiprocessor exhibits good speedup rates approaching linearity when compared to sequential quicksort.
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.
