|
|
| Don't ask to ask, just ask | |
| PerlMonks |
Re^11: PDL and srand puzzleby etj (Priest) |
| on Jun 09, 2024 at 13:38 UTC ( [id://11159841]=note: print w/replies, xml ) | Need Help?? |
|
No. It may indicate PDL's random() is being seeded incorrectly.
PDL's RNG is at https://github.com/PDLPorters/pdl/blob/master/Basic/Primitive/xoshiro256plus.c, and generates 64(!) bits of randomness, of which only 53 are used in an IEEE 754 double-precision number. See the comments in that file for limitations, including that the lowest 3 bits can fail linearity testing, which is not likely to be a problem. Note it generates n (a parameter) seeds, not necessarily just one, so independent POSIX threads will have different seeds if PDL's built-in POSIX threading is used to generate large amounts of random numbers. PDL's srandom function, if not given an input, uses PDL::Core::seed - see https://github.com/PDLPorters/pdl/pull/352. There is no interaction with Perl's srand() or rand() functionality. EDIT - I have just realised that Perl's "threads" functionality might clash with this, if it uses POSIX threads: PDL's RNG has a global vector of n seeds, in a global C variable. PDL's code will, if it is being used in what it thinks is single-threaded mode, use the 0th offset in that. If multiple POSIX threads are accessing that single seed (which gets updated on each RNG generation), there will be a race condition, hence less uniqueness. The workaround for that would be to generate the random numbers in the main thread first, possibly using PDL's multithreading if there are >1e6 elements in the ndarray, then use those suitably divided in the Perl threads.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||||||||||||||