- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hello,
ParallelSort library was updated to version 2.5..
I have completly changed the mergesort function and it's now working perfectly.
And parallel mergesort is now faster than parallel quicksort and parallel heapsort.
Description:
Parallel Sort Library that supports Parallel Quicksort, Parallel HeapSort and
Parallel Sort Library that supports Parallel Quicksort, Parallel HeapSort and
Parallel MergeSort on Multicores systems. Parallel Sort Library 2.5 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 -
- Parallelizing the Sorts:
- Parallelizing the Sorts:
One way to parallelize the sorts is:
1- Divide the data among the processors
2- Sort the data on the individual processors.
3- Merge the various data
2- Sort the data on the individual processors.
3- Merge the various data
Note that the merge operation is a reduction operation !
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.
version i have parallelized also the merge procedure part and it gives better performance.
You can download ParallelSort library version 2.5
from:
http://pages.videotron.com/aminer/
Thank you,
Amine Moulay Ramdane.
http://pages.videotron.com/aminer/
Thank you,
Amine Moulay Ramdane.
Link Copied
0 Replies
![](/skins/images/B7BA37F9CE4B52FF7CAE1FB0388839C8/responsive_peak/images/icon_anonymous_message.png)
Reply
Topic Options
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page