Show simple item record

dc.contributor.authorAsaduzzaman, Abu
dc.contributor.authorMaiti, Anindya
dc.contributor.authorYip, Chok Meng
dc.date.accessioned2015-04-24T16:51:29Z
dc.date.available2015-04-24T16:51:29Z
dc.date.issued2015-01-04
dc.identifier.citationAsaduzzaman, Abu, Maiti, Anindya and Chok M. Yip. 2015. Fast effective deterministic primality test using CUDA/GPGPU. International Journal of Computers & Technology;v.12 no.3, pp. 3738-3746,en_US
dc.identifier.issn2277-3061
dc.identifier.urihttp://ijctonline.com/ojs/index.php/ijct/article/view/3465/pdf_351
dc.identifier.urihttp://hdl.handle.net/10057/11240
dc.descriptionClick on the URL link to access the article.en_US
dc.description.abstractThere are great interests in understanding the manner by which the prime numbers are distributed throughout the integers. Prime numbers are being used in secret codes for more than 60 years now. Computer security authorities use extremely large prime numbers when they devise cryptographs, like RSA (short for Rivest, Shamir, and Adleman) algorithm, for protecting vital information that is transmitted between computers. There are many primality testing algorithms including mathematical models and computer programs. However, they are very time consuming when the given number n is very big or n→∞. In this paper, we propose a novel parallel computing model based on a deterministic algorithm using central processing unit (CPU) / general-purpose graphics processing unit (GPGPU) systems, which determines whether an input number is prime or composite much faster. We develop and implement the proposed algorithm using a system with an 8-core CPU and a 448-core GPGPU. Experimental results indicate that up to 94.35x speedup can be achieved for 21-digit decimal numbers.en_US
dc.language.isoen_USen_US
dc.publisherCouncil for Innovative Researchen_US
dc.relation.ispartofseriesInternational Journal of Computers & Technology;v.12 no.3
dc.subjectCUDA architectureen_US
dc.subjectDeterministic algorithmen_US
dc.subjectGPU computingen_US
dc.subjectParallel computingen_US
dc.subjectPrimality testen_US
dc.subjectResearch Subject Categories::MATHEMATICSen_US
dc.subjectResearch Subject Categories::TECHNOLOGY::Electrical engineering, electronics and photonics::Electrical engineeringen_US
dc.subjectHigh Performance Computingen_US
dc.subjectParallel programmingen_US
dc.subjectLow power systemen_US
dc.titleFast effective deterministic primality test using CUDA/GPGPUen_US
dc.typeArticleen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record