Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #2662
| From | Ramine <ramine@1.1> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | Re: Parallel Sort library benchmarks are amazing |
| Date | 2014-11-04 11:23 -0800 |
| Organization | A noiseless patient Spider |
| Message-ID | <m3aufm$15h$2@dont-email.me> (permalink) |
| References | <m3atgu$se5$2@dont-email.me> |
Hello, My Parallel Sort library supports Parallel Quicksort and Parallel MergeSort and Parallel Heapsort, but you have to know that i have optimized the Quicksort insidemy Parallel Sort library so that its partition() function avoids worst case performance and so that it uses the median-of-three, so the Quicksort inside my Parallel Sort library is the fastest around.. the Mersort too inside my Parallel Sort library is the fastest around , so all in all i have brought to you a wonderful Parallel library that is one of the fastest around and that is scalable ! I have updated my Parallel Sort library , you can download it from: https://sites.google.com/site/aminer68/parallel-sort-library Thank you, Amine Moulay Ramdane.
Back to comp.programming.threads | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Parallel Sort library benchmarks are amazing Ramine <ramine@1.1> - 2014-11-04 11:06 -0800 Re: Parallel Sort library benchmarks are amazing Ramine <ramine@1.1> - 2014-11-04 11:23 -0800 Re: Parallel Sort library benchmarks are amazing Ramine <ramine@1.1> - 2014-11-04 11:31 -0800
csiph-web