Re: [Gretl-users] Julia Micro-Benchmarks
Am 26.02.2018 um 16:22 schrieb Artur Tarassow:
Maybe, a the flag "using no JIT" should be added for
gretl/hansl then.
IMHO this would only make sense if there were a switch where a compiler
could be switched on instead (which is not the case of course).
These are results I've obtained on my Ubuntu (17.10) machine:
matlab(2014a) R (3.4.3) gretl (2017e)
recursion_fibonacci 53.87 5.00 107.87
parse_integers 13.45 2.00 3.22
userfunc_mandelbrot 4.31 11.00 144.89
recursion_quicksort 8.62 12.00 264.26
iteration_pi_sum 29.68 221.00 1750.23
matrix_statistics 28.27 71.00 17.20
matrix_multiply 26.31 67.00 22.33
print_to_file 711.43 648.00 382.34
Thanks, Artur, interesting. To me this looks quite OK from gretl's point
of view. The tasks or algorithms where gretl is much slower are those
that aren't really typical or relevant for econometrics and statistics
I'd say. (Anybody feel free to correct me!) Of course that's always the
problem with micro benchmarks in the first place.
Perhaps the only thing where I'd like to know more is the
"recursion_quicksort" kind of thing. (Haven't really looked at the code
yet.) In particular, is there some built-in gretl function that would
normally be used for this kind of task instead of writing a home-cooked
hansl function?
Again, that's not what this micro benchmark thing is about, but in order
to learn about gretl's strenghts and weaknesses it would be useful.
thanks,
sven