DocumentCode
2126271
Title
Implementation of Mersenne primes solution algorithm based on CUDA
Author
Yang, Dong ; Fan, Xiaoya ; Li, Yuyan
Author_Institution
Coll. of Comput. Sci., Northwestern Polytech. Univ., Xi´´an, China
fYear
2012
fDate
21-23 April 2012
Firstpage
3280
Lastpage
3283
Abstract
Based on the characteristics of the lucas-lehmer´s serial algorithm, this article analyses throughly and extracts the parallelism existing in the algorithm. While the core calculation can be achieved by using the parallelized FFT (Fast Fourier Transformation), the program will be optimized under CUDA platform basing on the hardware architecture of GPU. And the results showed that performance has been greatly improved by implementing the LUCAS algorithm on GPU, compared with implementing this algorithm on serial CPU.
Keywords
fast Fourier transforms; graphics processing units; parallel architectures; CUDA; GPU; Lucas-Lehmer serial algorithm; Mersenne primes solution algorithm; fast Fourier transformation; hardware architecture; parallelized FFT; Algorithm design and analysis; Arrays; Central Processing Unit; Equations; Graphics processing unit; Mathematical model; CUDA; Lucas-lehmer algorithm; Mersenne numbers; parallel computation;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on
Conference_Location
Yichang
Print_ISBN
978-1-4577-1414-6
Type
conf
DOI
10.1109/CECNet.2012.6201974
Filename
6201974
Link To Document