Hello,
i need some input on the parallelisation of quicksort.
If anyone knows a more appropriate forum/list than
this, please tell me =)
I've written 2 different approaches to the quicksort
parallelisation.
1. The "master" server splits the array of numbers
into N seperate parts, where N is the
Thanks for your input,
--- Andreas Schäfer wrote:
> that even though this results in _many_ messages,
> the algorithms
> optimal runtime complexity will compensate for it.
>
> But benchmark your own ;-)
I will study through the suggested paper, however
i actually read a different paper which s
