sorting and load balancing

I 开发者_如何学Goread about parallel quicksort ( but no load balancing ). who can give good algorithm for using on 2, 4, 8 cores?

For Intel multicore CPUs, there's this paper.

This will give insight http://sortbenchmark.org/

Algorithms doesnt depend on hardware.

You can implement your program to use multiple core cpus, ie: multi threading, however, quick sort is quick sort. the algorithms (idea) is same.

What you can do is, for a dual core CPU, once you divide the input to two, you can assign each partition to one core and continue in the same way. at the end you can merge the results. This is becoming like a merge sort though, except that you use a pivot.