I can think of parallel quicksort and mergesort, any other parallel sorting algorithms being implemented? And, what's the performance advantage/tradeoff of implementing them in a parallel way? It seems to me that creating loads of pthreads doing small amount of jobs is a waste and incurs huge overhead, there must be a balance between using serial sorts and parallel sorts. Would be great to see if someone could point me to an implementation of such parallel sorts being efficiently implemented/used. thanks a lot.
Last edited by ww250
on August 15th, 2011, 10:00 pm, edited 1 time in total.