https://community.intel.com/t5/Intel-Moderncode-for-Parallel/ParallelSort-library-was-updated-to-version-2-5/m-p/768659#M90 <DIV><BR /><BR />Hello,<BR /><BR /> <DIV><BR />ParallelSort library was updated to version 2.5..<BR /><BR />I have completly changed the mergesort function and it's now working perfectly.<BR /><BR />And parallel mergesort is now faster than parallel quicksort and parallel heapsort.<BR />&nbsp;<BR /></DIV> <DIV>Description:<BR /><BR />Parallel Sort Library that supports Parallel Quicksort, Parallel HeapSort and </DIV> <DIV>Parallel MergeSort&nbsp;on Multicores systems. Parallel Sort Library 2.5 uses my </DIV> <DIV>Thread Pool Engine and quicksort many array parts - of your array -&nbsp; in parallel </DIV> <DIV>using Quicksort or HeapSort or MergeSort and after that it finally merge them </DIV> <DIV>- with the merge() procedure - <BR /><BR />- Parallelizing the Sorts:</DIV> <DIV>One way to parallelize the sorts is: </DIV> <DIV>1- Divide the data among the processors <BR />2- Sort the data on the individual processors. <BR />3- Merge the various data</DIV> <DIV><BR />Note that the merge operation is a reduction operation !</DIV> <DIV>&nbsp;</DIV> <DIV>In the previous parallelsort version i have parallelized only the sort part, but in this new parallelsort <BR />version i have parallelized also the merge procedure part and it gives better performance.</DIV> <DIV>&nbsp;</DIV> <DIV>You can download ParallelSort library version 2.5 from:<BR /><BR /><A href="http://pages.videotron.com/aminer/" target="_blank">http://pages.videotron.com/aminer/</A><BR /><BR /><BR /><BR />Thank you,<BR />Amine Moulay Ramdane.</DIV> <DIV>&nbsp;</DIV></DIV> Sat, 11 Aug 2012 21:46:06 GMT aminer10 2012-08-11T21:46:06Z https://community.intel.com/t5/Intel-Moderncode-for-Parallel/ParallelSort-library-was-updated-to-version-2-5/m-p/768659#M90 <DIV><BR /><BR />Hello,<BR /><BR /> <DIV><BR />ParallelSort library was updated to version 2.5..<BR /><BR />I have completly changed the mergesort function and it's now working perfectly.<BR /><BR />And parallel mergesort is now faster than parallel quicksort and parallel heapsort.<BR />&nbsp;<BR /></DIV> <DIV>Description:<BR /><BR />Parallel Sort Library that supports Parallel Quicksort, Parallel HeapSort and </DIV> <DIV>Parallel MergeSort&nbsp;on Multicores systems. Parallel Sort Library 2.5 uses my </DIV> <DIV>Thread Pool Engine and quicksort many array parts - of your array -&nbsp; in parallel </DIV> <DIV>using Quicksort or HeapSort or MergeSort and after that it finally merge them </DIV> <DIV>- with the merge() procedure - <BR /><BR />- Parallelizing the Sorts:</DIV> <DIV>One way to parallelize the sorts is: </DIV> <DIV>1- Divide the data among the processors <BR />2- Sort the data on the individual processors. <BR />3- Merge the various data</DIV> <DIV><BR />Note that the merge operation is a reduction operation !</DIV> <DIV>&nbsp;</DIV> <DIV>In the previous parallelsort version i have parallelized only the sort part, but in this new parallelsort <BR />version i have parallelized also the merge procedure part and it gives better performance.</DIV> <DIV>&nbsp;</DIV> <DIV>You can download ParallelSort library version 2.5 from:<BR /><BR /><A href="http://pages.videotron.com/aminer/" target="_blank">http://pages.videotron.com/aminer/</A><BR /><BR /><BR /><BR />Thank you,<BR />Amine Moulay Ramdane.</DIV> <DIV>&nbsp;</DIV></DIV> Sat, 11 Aug 2012 21:46:06 GMT https://community.intel.com/t5/Intel-Moderncode-for-Parallel/ParallelSort-library-was-updated-to-version-2-5/m-p/768659#M90 aminer10 2012-08-11T21:46:06Z