Re: ParallelSort library has been updated to version 2.2 ...

Path	csiph.com!usenet.pasdenom.info!aioe.org!eternal-september.org!feeder.eternal-september.org!mx04.eternal-september.org!.POSTED!not-for-mail
From	"aminer" <aminer@videotron.ca>
Newsgroups	comp.programming.threads, comp.programming
Subject	Re: ParallelSort library has been updated to version 2.2 ...
Date	Sat, 26 May 2012 12:39:58 -0500
Organization	A noiseless patient Spider
Lines	78
Message-ID	<jpr119$eo0$1@dont-email.me> (permalink)
References	<jpp0mi$goq$1@dont-email.me>
Injection-Date	Sat, 26 May 2012 16:40:09 +0000 (UTC)
Injection-Info	mx04.eternal-september.org; posting-host="2tHS3m0PYHvqOg8N0HjimQ"; logging-data="15104"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX182/Kk7FPYrtb6dn5RADB5q"
X-MimeOLE	Produced By Microsoft MimeOLE V6.00.2900.5512
X-RFC2646	Format=Flowed; Response
X-Newsreader	Microsoft Outlook Express 6.00.2900.5512
Cancel-Lock	sha1:dUZH22vetTAtGrcb+iJLdANA4fQ=
X-Priority	3
X-MSMail-Priority	Normal
Xref	csiph.com comp.programming.threads:893 comp.programming:1624

Cross-posted to 2 groups.

Show key headers only | View raw

Hello,

I have done some scalability tests and i have come to the conclusion that
parallel heapsort is better on scalability than parallel quicksort cause the
P part (of the Amdahl equation) is bigger in parallelheapsort than parallel
quicksort, the parallel heapsort is doing more on the parallel part, it's 
why
it scales better than parallel quicksort, but parallel quicksort is still 
faster
than parallel heapsort and parallel merge sort on my tests on a
quad core processor.



Amine Moulay Ramdane



"aminer" <aminer@videotron.ca> wrote in message 
news:jpp0mi$goq$1@dont-email.me...
>
> Hello,
>
> ParallelSort library has been updated to version 2.12..
>
> In the previous version i have parallelized only the sort part, but
> in this version i have parallelized also the merge procedure part and it 
> gives
> better performance.
>
>
> You can download parallelsort library version 2.0 from:
>
> http://pages.videotron.com/aminer/
>
>
> Description:
>
> Parallel Sort Library that supports Parallel Quicksort, Parallel HeapSort
> and Parallel MergeSort on Multicores systems.
>
> Parallel Sort Library 2.0 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 Sorts
>
> One 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+: http://www.freepascal.org/
> 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.
>
>
>
>
>

Back to comp.programming | Previous | Next — Previous in thread | Find similar

Thread

ParallelSort library has been updated to version 2.2 ... "aminer" <aminer@videotron.ca> - 2012-05-25 18:22 -0500
  Re: ParallelSort library has been updated to version 2.2 ... "aminer" <aminer@videotron.ca> - 2012-05-25 18:27 -0500
  Re: ParallelSort library has been updated to version 2.2 ... "aminer" <aminer@videotron.ca> - 2012-05-26 12:00 -0500
  Re: ParallelSort library has been updated to version 2.2 ... "aminer" <aminer@videotron.ca> - 2012-05-26 12:39 -0500

csiph-web