RFR 8020292 <was> :Re: class SplittableRandom

David Chase david.r.chase at oracle.com
Mon Jul 15 18:07:58 UTC 2013

On 2013-07-15, at 9:02 AM, Aleksey Shipilev <aleksey.shipilev at oracle.com> wrote:
> The conclusion is: SR is a reasonable alternative with no obvious
> performance show-stoppers. That said, TLR is also reasonably fast at
> this point, and further improvements to TLR will probably beat the SR or
> tie it on most scenarios.

I think that depends on the nature of the improvements.
TLR doesn't currently pass DieHarder; that's a problem for some people.
An additional advantage of SR (as I understand it) is that it allows
deterministic replay of the  random numbers in a given fork-join tree.


More information about the core-libs-dev mailing list