| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
GpuLucas
| Workload type | Lucas-Lehmer test |
| First release | 2012 |
| Latest version | 0.9.4 16-03-2012 |
gpuLucas is a CUDA-based program written by Andrew Thall for testing Mersenne numbers for primality.
gpuLucas parallelizes the IBDWT-method for fast multiplies modulo Mersenne numbers.
gpuLucas was developed under Windows 7 using Visual C++ in Visual Studio 2008 as a research code, but has since been ported to Linux.
At the time of its announcement in 2010, it could perform nearly two times faster than CUDALucas due to using non-power-of-2 FFT lengths. PDF given here, Implementation details were published in 2011 and the source code was released in 2012 under BSD license (even though supporting libraries use GPL). [1] [2]
The code was further developed by Aaron Haviland, who improved I/O, added autodetection of optimal FFT size, saving checkpoints, etc.
External links
- Haviland's releases at GitHub
- Haviland's fork at GitHub
- Thall's source code at GitHub
- gpuLucas thread at MersenneForum
- Thall, A. Fast Mersenne Prime Testing on the GPU (2011)
