In which algorithms is the random number generation the bottleneck?
Generating well distributed random numbers with low overhead is quire important for that.
It's not the bottleneck, but it is very important.
I switched to PCG with Lemire’s nearly divisionless modular reduction, and the performance numbers were sensible again.