Please run this benchmark

[Ramine]

Hello,


I have implemented a benchmark for my Parallel sort library,
and i want to test it on other computers, please help me to do it,
this benchmark runs on windows, please download it and run it and report
to me your kind of processor and if it's possible how many L2 caches you
have, and report to me the output of this benchmark, this benchmark is
testing my parallel mergesort of my parallel sort library, please
download the benchmark from here and run it:

https://sites.google.com/site/aminer68/benchmark-for-parallel-sort-library


To download it please click on the small "arrow" on the right of the
"test.zip" text on your screen...


Thank you,
Amine Moulay Ramdane.

[Ramine]

If you have more than 4 cores on your computer, it will be really
interresting to see what's the result of my benchmark on your computer.

If you have an Intel i7 CPU , this will be also interresting to see the
result on it...


So please help me to see what's the results of my parallel sort library,
so run the benchmark.

[Melzzzzz]

[bmaxa@maxa-pc aminer]$ taskset -c 0,1,2,3 wine test.exe


Number of cores is: 4
Scalability on 4 cores is: 2.42

Please press a key to exit...:
[bmaxa@maxa-pc aminer]$ taskset -c 0,1,2,3,4,5,6,7 wine test.exe


Number of cores is: 8
Scalability on 8 cores is: 3.30

Please press a key to exit...:
[bmaxa@maxa-pc aminer]$

[bmaxa@maxa-pc aminer]$ inxi -C
CPU: Quad core Intel Core i7-4790 (-HT-MCP-) cache: 8192 KB
clock speeds: max: 4000 MHz 1: 3958 MHz 2: 3977 MHz 3: 3995 MHz 4: 3994 MHz 5: 4000 MHz 6: 3968 MHz
7: 3998 MHz 8: 3924 MHz
[bmaxa@maxa-pc aminer]$

[Ramine]

Hello,


Please Melzzzz i have just implemented and uploaded a full benchmark,
this one will test all the sorting algorithms, can you download the new
benchmark again and test it with your computers that have 4 cores and
the other that have 8 cores.

Here it is:

https://sites.google.com/site/aminer68/benchmark-for-parallel-sort-library

[Melzzzzz]

On Fri, 13 Feb 2015 18:53:05 -0800
Ramine <ramine@1.1> wrote:

>
> Hello,
>
>
> Please Melzzzz i have just implemented and uploaded a full benchmark,
> this one will test all the sorting algorithms, can you download the
> new benchmark again and test it with your computers that have 4 cores
> and the other that have 8 cores.

It's i7 4790. 4 cores with HT

>
> Here it is:
>
> https://sites.google.com/site/aminer68/benchmark-for-parallel-sort-library
>
>
> Thank you,
> Amine Moulay Ramdane.

[bmaxa@maxa-pc aminer]$ taskset -c 0,1,2,3 wine test.exe


Number of cores is: 4

Scalability with parallel mergesort on 4 cores is: 2.38
Time of parallel mergesort on 4 cores is: 304864 microseconds

Number of cores is: 4

Scalability with parallel quicksort on 4 cores is: 2.64
Time of parallel quicksort on 4 cores is: 334282 microseconds

Number of cores is: 4

Scalability with parallel heapsort on 4 cores is: 4.30
Time of parallel heapsort on 4 cores is: 753477 microseconds

Please press a key to exit...:
[bmaxa@maxa-pc aminer]$ taskset -c 0,1,2,3,4,5,6,7 wine test.exe


Number of cores is: 8

Scalability with parallel mergesort on 8 cores is: 3.23
Time of parallel mergesort on 8 cores is: 298091 microseconds

Number of cores is: 8

Scalability with parallel quicksort on 8 cores is: 3.52
Time of parallel quicksort on 8 cores is: 348340 microseconds

Number of cores is: 8

Scalability with parallel heapsort on 8 cores is: 7.36
Time of parallel heapsort on 8 cores is: 807979 microseconds

[Ramine]

Hello,


I think i have finally understood my parallel algorithms:

Look at my parallel heapsort results:

Number of cores is: 8
Scalability with parallel heapsort on 8 cores is: 7.36
Time of parallel heapsort on 8 cores is: 807979 microseconds

I think that my parallel heapsort algorithm is by nature more cache
efficient this is why it scales very well on more and more cores, so if
you have more cores than 8 cores, i think that my parallel heapsort of
my parallel sort library will be better to replace the other parallel
algorithms such as my parallel mergesort and my parallel quicksort
of my parallel sort library.


The benchmark's results also inform us on an important think: it is that
the parallel mergesort and parallel quicksort of my parallel sort
library are by nature much less cache efficient than my parallel
heapsort of my parallel sort library.


Thank you Melzzzz, you are such a great guy that you have helped me to
run the benchmark.



Amine Moulay Ramdanae.