Parallel Sort Library was updated to version 3.01

[aminer]

Hello,

Parallel Sort Library was updated to version 3.01.

In this new version i have implemented a Parallel hybrid divide-and-conquer
merge algorithm that performs 0.9-5.8 times better than sequential merge, on
a quad-core processor, with larger arrays outperforming by over 5 times.
Parallel processing combined with a hybrid algorithm approach provides a
powerful high performance result.


Description:

Parallel Sort Library that supports Parallel Quicksort, Parallel HeapSort
and Parallel MergeSort on Multicores systems.

Parallel Sort Library uses my Thread Pool Engine and quicksort many array
parts - of your array - in parallel using Quicksort or HeapSort or
MergeSort and after that it finally merge them - with the merge()
procedure -

In the previous parallelsort version i have parallelized only the sort part,
but in this new parallelsort version i have parallelized also the merge
procedure part and it gives better performance.

I have implemented a Parallel hybrid divide-and-conquer merge algorithm that
performs 0.9-5.8 times better than sequential merge, on a quad-core
processor, with larger arrays outperforming by over 5 times. Parallel
processing combined with a hybrid algorithm approach provides a powerful
high performance result.

And please look at test.pas inside the zip, you have to compile and run
gendata.pas
before running test.pas, and please set the number of threads to 8 times
the number
of cores to be more optimal, i have giving you an exemple on how to do it ,
look inside
test.pas...

You can download ParallelSort library from:

http://pages.videotron.com/aminer/



Thank you,
Amine Moulay Ramdane.