Parallelsort library was updated to version 2.2 ...

Parallelsort library was updated to version 2.2 ...


ParallelSort library has been updated to version 2.2..
In the previous version i haveparallelized only the sort part, but
in this version i have parallelized alsothe merge procedure part and it gives
better performance.You can download parallelsort library version 2.0 from:
Parallel Sort Library that supports Parallel Quicksort, Parallel HeapSort
and Parallel MergeSort on Multicores systems.
Parallel Sort Library 2.2 uses my Thread Pool Engine and quicksort many
array parts - of your array - in parallel using Quicksort or HeapSort or MergeSort a
nd after that it finally merge them - with the merge() procedure -

Parallelizing the SortsOne way to parallelize the sorts is: Divide the data among the processors
Sort the data on the individual processors.
Merge the various data Note that the merge operation is a reduction operation !

And please look at test.pas a parallel quicksort on many cores - compile and execute it...

Language: FPC Pascal v2.2.0+ / Delphi 7+:
Operating Systems: Win , Linux and Mac (x86).
Required FPC switches: -O3 -Sd -dFPC -dWin32 -dFreePascal
-Sd for delphi mode....
Required Delphi switches: -DMSWINDOWS -$H+
For Delphi 5,6,7 use -DDelphi
For Delphi 2005,2006,2007,2009,2010+ use the switch -DDELPHI2005+

Thank you.
Amine Moulay Ramdane.

4 Beiträge / 0 neu
Letzter Beitrag
Nähere Informationen zur Compiler-Optimierung finden Sie in unserem Optimierungshinweis.


Parallelsort library was updated to version 2.22 ,
you can download it from:

What have changed in version 2.22 ?

Since i have set the length of the tab1 array like this:

If rest > 0
SetLength(tab1,0) ;

Ituses less memory now, and i have also forgot to set the length of
tab1 to zero in the previous version, and i have corrected this in
version 2.22.

Thank you.
Amine Moulay Ramdane.

Hello,I have done some scalability tests and i have come to the conclusion that parallel heapsort is better on scalability than parallel quicksort causethe P part (of the Amdahl equation)is bigger inparallelheapsort thanparallel quicksort, the parallel heapsort is doingmoreon the parallel part, it's whyit scales better thanparallel quicksort, but parallel quicksort is still faster than parallel heapsort and parallel merge sort on my tests on a quad core processor.Thank you.

Amine Moulay Ramdane

Microsoft Office 2010 is actually the newest software from microsoft office 2010 keys Microsoft Corporation introduced in the last year. Its leading aims tend to be to catch the present business requirements and to be on top of every competition with regard to the international market criteria. This can be a very good idea to obtain Microsoft Office 2010 Key immediately to maintain norton antivirus keys yourself up-to-date and to present you with the vast qualified progress opportunities for success. Microsoft Office 2010 is available in both 32-bit and 64-bit editions, but attention please the two are not able to co-exist on the very same personal computer. All of the Office 2010 editions are kaspersky antivirus keys suitable for Windows XP SP3, Windows Vista and Windows 7.

Melden Sie sich an, um einen Kommentar zu hinterlassen.