Package1.0.0.1MathSystem
mersenne-random
Generate high quality pseudorandom numbers using a SIMD Fast Mersenne Twister
- Version1.0.0.1
- CategoryMath, System
- LicenceBSD-3-Clause
- AuthorDon Stewart
- MaintainerDon Stewart <dons00@gmail.com>
- Homepagecode.haskell.org/~dons/code/mersenne-random
- Pinned byhackage mersenne-random 1.0.0.1
- Sourcehackage.haskell.org/package/mersenne-random-1.0.0.1
Modules
1 module- System.Random.Mersenne7Generate pseudo-random numbers using the SIMD-oriented Fast Mersenne Twister(SFMT)
Description
The Mersenne twister is a pseudorandom number generator developed by Makoto Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence over a finite binary field. It provides for fast generation of very high quality pseudorandom numbers
This library uses SFMT, the SIMD-oriented Fast Mersenne Twister, a variant of Mersenne Twister that is much faster than the original. It is designed to be fast when it runs on 128-bit SIMD. It can be compiled with either SSE2 and PowerPC AltiVec support, to take advantage of these instructions.
cabal install -fuse_sse2
On an x86 system, for performance win.
By default the period of the function is 2^19937-1, however, you can compile in other defaults. Note that this algorithm on its own is not cryptographically secure.
For more information about the algorithm and implementation, see the SFMT homepage,
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
and, Mutsuo Saito and Makoto Matsumoto, /SIMD-oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator/, in the Proceedings of MCQMC2006, here:
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/ARTICLES/sfmt.pdf
Depends on
2 packages- base-4.20.2.0with GHC
- old-time-1.1.0.4in this set
Used by in this set · 0
Nothing in this set depends on it.