![]() |
![]() |
#1 |
Sep 2002
31316 Posts |
![]()
I hope no one minds my making a new topic. I haven't participated in Prime 95 for nearly a decade back when the V4 was up and running. My current test is M54938133. My computer has an I7 Q720 Quad Core on Windows 7 64 bit. My question is very simple and this thread might be helpful for other users who are completely knew or haven't participated in years as a baseline. This number is currently doing a first time LL set to display every 20 thousand iterations and it reports that as running between 0.07 and 0.08 seconds for those 20 thousand. I'd like to know if that's a good iteration time for that many as I don't remember how to calculate the exact per iteration time for one iteration. Thank you. If Prime95 himself doesn't like this thread or someone else objects, feel free to delete it or move it or whatever you would like to do.
|
![]() |
![]() |
![]() |
#2 |
Apr 2010
Over the rainbow
23·317 Posts |
![]()
The 0.08 sec is by iteration. that mean you will have to run for about 50 days (0.08 *54938133 =4395050,64 seconds = 1220.84 hours=50.86 days) . I would say that is pretty quick.
|
![]() |
![]() |
![]() |
#3 |
Sep 2002
11000100112 Posts |
![]()
Thank you for the fast response. It's going to take a bit of time for me to get all this back in my brain the way it should be.
|
![]() |
![]() |
![]() |
#4 | |
Einyen
Dec 2003
Denmark
22×13×59 Posts |
![]()
Those are the average iteration times over 20,000 iterations. If you want more accuracy add these 2 lines to prime.txt:
PercentPrecision=6 TimingOutput=4 From undoc.txt: Quote:
Your processor at 55M exponent is about 70-75 ms in the chart (0.07-0.075 sec). Last fiddled with by ATH on 2011-09-08 at 19:35 Reason: Added extra information |
|
![]() |
![]() |
![]() |
#5 |
Sep 2002
Oeiras, Portugal
1,451 Posts |
![]()
Welcome back, Jwb52z!
It´s good to see old gimpsters (re)joining the ranks. Old loves die hard, isn´t it?... |
![]() |
![]() |
![]() |
#6 |
Dec 2010
Monticello
179510 Posts |
![]()
Possibly this belongs under information and answers... oh well....
There are some new kids on the prime block you might want to know about in conjunction with openCL and CUDA GPUs: mfaktc, mfakto, and cudaLUCAS. All of them require GPUs. cudaLUCAS is moderately fast; mfaktc and mfakto run circles around CPUs at trial factoring, but still require a significant amount of CPU for part of their operation. |
![]() |
![]() |
![]() |
#7 |
Sep 2002
11000100112 Posts |
![]()
Thank you Lycorn. As for what the chart says, I think for me that timing would only be if I never used my system because it's now ranging .08 to .09 per iteration.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Time per iteration | em99010pepe | Riesel Prime Search | 7 | 2007-08-30 08:54 |
iteration time under XP | Unregistered | Software | 20 | 2004-09-30 06:35 |
WHAT IS PER ITERATION TIME? | MavsFan | Software | 1 | 2003-12-12 02:35 |
iteration time log | crash893 | Software | 1 | 2002-11-13 05:45 |
Per iteration time | sofII | Software | 8 | 2002-09-07 01:51 |