Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #2661
| From | Ramine <ramine@1.1> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | Parallel Sort library benchmarks are amazing |
| Date | 2014-11-04 11:06 -0800 |
| Organization | A noiseless patient Spider |
| Message-ID | <m3atgu$se5$2@dont-email.me> (permalink) |
Hello, My Parallel Sort library benchmarks are amazing... I have done some benchmarks on my X86 Quadcore Q6600 by sorting arrays of strings and my Parallel Sort library is scaling very well, here is the numbers: With ctQuicksort(with quicksort) my Parallel Sort library is scaling to 3.65x with ctMergesort(with mergesort) my Parallel Sort library is scaling to 3.20x And ctMergesort is faster than ctQuicksort on single thread by 20%. My other Parallel Quicksort library is scaling much less than my Parallel Sort library, so all in all i have giving you a wonderful Parallel Sort library that is very fast and 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 — 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