Kenji Rikitake did similar work in Erlang a few years ago, suggesting SIMD--oriented Fast Mersenne Twister (SFMT) as a replacement for the random number generator in Erlang. I believe he also worked on updating the old Wichmann-Hill generator code from a 1982 version of the algorithm to a newer 2006 version. He gave a talk[1] on PRNGs at Erlang Factory which was pretty good and might be useful here, there is also a paper[2] on the same topic. This kind of stuff was also discussed[3] quite a bit on the mailing list at the time as well.
[1] http://www.erlang-factory.com/conference/SFBay2011/speakers/kenjirikitake [2] http://dl.acm.org/citation.cfm?id=2034669 [3] http://erlang.2086793.n4.nabble.com/Implementation-of-a-2006-version-of-Wichmann-Hull-random-number-generator-for-Erlang-OTP-td3055286.html jack. _______________________________________________ Rust-dev mailing list Rust-dev@mozilla.org https://mail.mozilla.org/listinfo/rust-dev
