mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2021-03-12, 20:26   #12
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

10778 Posts
Default

Quote:
Originally Posted by Jeff Gilchrist View Post
Just did another test using our latest PRP with beta3:

llrCUDA - GPU Version 3.8.3b3 ; linked with CUDA Version 8.0.44
2^13380298-27 is a Fermat Probable prime! (4027872 decimal digits) Time : 136632.210 sec.

By comparison using 4 threads on an Intel Core i7-6700K took (for base 3-Fermat PRP test): 12456.743 sec.

So the GPU version is running about 11 times slower. Is that what you would expect for speed with a fermat number like this? Are there specific types of numbers that should be a lot faster with the GPU code?
You are Fermat testing a base two and k == 1 number ; so, unfortunately, it is optimal for this present version of the program, but this speed depends on the GPU card you are using...
Indeed, your multi-core CPU is much faster!

Regards,
Jean
Jean Penné is offline   Reply With Quote
Old 2021-03-13, 08:42   #13
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

5,857 Posts
Default

Quote:
Originally Posted by Jean Penné View Post
You are Fermat testing a base two and k == 1 number ; so, unfortunately, it is optimal for this present version of the program, but this speed depends on the GPU card you are using...
Indeed, your multi-core CPU is much faster!

Regards,
Jean
If you look at post 9, he is using a P100 which is quite a good gpu.
henryzz is online now   Reply With Quote
Old 2021-03-19, 20:29   #14
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

52×23 Posts
Default

Quote:
Originally Posted by Jean Penné View Post
You are Fermat testing a base two and k == 1 number ; so, unfortunately, it is optimal for this present version of the program, but this speed depends on the GPU card you are using...
Indeed, your multi-core CPU is much faster!

Regards,
Jean
I was wrong in this post :
The test is all but optimal, because it is done in generic modular reduction mode!
That is to say : this version of llrCUDA is not presently suited to test 2^n+c numbers when abs(c) != 1 because generic mode is forced.

sorry for this drawback...

Jean
Jean Penné is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
LLR Version 3.8.21 Released Jean Penné Software 26 2019-07-08 16:54
LLR Version 3.8.16 released Jean Penné Software 38 2015-12-10 07:31
LLR Version 3.8.15 released Jean Penné Software 28 2015-08-04 04:51
LLR Version 3.8.9 released Jean Penné Software 37 2013-10-31 08:45
llr 3.8.2 released as dev-version opyrt Prime Sierpinski Project 11 2010-11-18 18:24

All times are UTC. The time now is 08:39.

Thu Apr 15 08:39:40 UTC 2021 up 7 days, 3:20, 0 users, load averages: 1.26, 1.42, 1.44

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.