ashikk
/
random_well512a_simd
mirror of https://github.com/ppettersson/random_well512a_simd.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
A SIMD optimized version of the WELL512a random algorithm.
5 Commits 1 Branch 0 Tags 44 KiB
C++ 81.3%
Makefile 14.5%
C 4.2%
Go to file
Peter Pettersson 4d92f13bf0 Get rid of macros. 2013-04-22 21:43:29 +02:00
VS2012 Build files for Visual Studio 2012. 2013-04-20 19:56:49 +02:00
gcc Add makefile for gcc and fix a compile error. 2013-04-20 20:51:09 +02:00
RandomWELL512a.cpp Initial version. 2013-04-20 19:56:34 +02:00
RandomWELL512a.h Initial version. 2013-04-20 19:56:34 +02:00
RandomWELL512a_SSE2.cpp Get rid of macros. 2013-04-22 21:43:29 +02:00
RandomWELL512a_SSE2.h Initial version. 2013-04-20 19:56:34 +02:00
Timer.h Initial version. 2013-04-20 19:56:34 +02:00
WELL512a.cpp Initial version. 2013-04-20 19:56:34 +02:00
WELL512a.h Initial version. 2013-04-20 19:56:34 +02:00
license.txt Initial version. 2013-04-20 19:56:34 +02:00
main.cpp Add makefile for gcc and fix a compile error. 2013-04-20 20:51:09 +02:00
readme.txt Initial version. 2013-04-20 19:56:34 +02:00

readme.txt 

A SIMD optimized version of the WELL512a random algorithm.

For a detailed description of how the algorithm works, please see the following pages:
1) http://en.wikipedia.org/wiki/Well_equidistributed_long-period_linear
2) http://www.iro.umontreal.ca/~panneton/WELLRNG.html

Benchmarking shows that the SSE2 implementation is generally about 2-3 times faster than
the C implementation by the original authors.

It requires a SSE2 capable CPU (i.e. Intel Pentium 4 or newer, AMD Athlon 64 or newer).

All the source code except WELL512a.cpp|h that contains the original implementation
are released under the BSD license which allows you to include this in any open
or closed source project.