No subject

[Vladimir Yaroslavskiy]

Hi Laurent,

The test suite was described in this paper

Jon L. Bentley, M. Douglas McILroy
“Engineering a Sort Function”, 1993

I use Java version (a little bit extended), see attachment.
What you need is to specified sorting classes in IntSorter.java
and run BentleyBasher.

Please let me know if you have questions/comments/improvements.

Thank you,
Vladimir 
>Понедельник, 12 ноября 2018, 14:01 +03:00 от Laurent Bourgès <bourges.laurent at gmail.com>:
>
>Dear Vladimir,
>
>>No information about JMH benchmarking.
> 
>I like it as Alexey made the best framework to benchmark short operations, like sorting small arrays.
> 
>For example, 1000 ints ~ 0.05ms on my i7 laptop at fixed freq = 2ghz.
> 
>>I use Bentley's test suite to compare algorithms.
> 
>Is it publicly available ? If yes, where ?
> 
>Cheers,
>Laurent
> 
>>
>>>Понедельник, 12 ноября 2018, 13:06 +03:00 от Laurent Bourgès < bourges.laurent at gmail.com >:
>>>
>>>Hi,
>>>
>>>Do you know if someone has written a complete JMH benchmark suite dedicated to Arrays.sort() ?
>>>with varying array size (trivial) but also testing lots of data distributions: (see Vladimir's tests) and possibly all variants (int, long, double, Object[] )
>>> 
>>>It could be part of the standard OpenJDK JMH test suite...
>>> 
>>>For now, I forked the nearly-optimal-mergesort repository on github:
>>>https://github.com/bourgesl/nearly-optimal-mergesort-code/tree/master/results
>>> 
>>>Cheers,
>>>Laurent

-- 
Vladimir Yaroslavskiy