I am going to abort them and turn off HT and see if the rest of the tasks will run and complete.
Hosts
https://srbase.my-firewall.org/sr5/show_host_detail.php?hostid=6978
https://srbase.my-firewall.org/sr5/show_host_detail.php?hostid=68132
____________
Crunching@EVGA The Number One Team in the BOINC Community. Folding@EVGA The Number One Team in the Folding@Home Community.
/ 
Reply
Quote
rebirtherVolunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Send message
Joined: 2 Jan 13
Posts: 7255
Credit: 42,729,227
RAC: 3
I am going to abort them and turn off HT and see if the rest of the tasks will run and complete.
Hosts
https://srbase.my-firewall.org/sr5/show_host_detail.php?hostid=6978
https://srbase.my-firewall.org/sr5/show_host_detail.php?hostid=68132
https://srbase.my-firewall.org/sr5/forum_thread.php?id=6&postid=698
you can always check your stderr.txt in slot dir to calculate the runtime in total
/ Reply
Quote
I am going to abort them and turn off HT and see if the rest of the tasks will run and complete.
Hosts
https://srbase.my-firewall.org/sr5/show_host_detail.php?hostid=6978
https://srbase.my-firewall.org/sr5/show_host_detail.php?hostid=68132
https://srbase.my-firewall.org/sr5/forum_thread.php?id=6&postid=698
you can always check your stderr.txt in slot dir to calculate the runtime in total
After restarting with HT the tasks started over.
They should not have to run 17 Hours to complete.
I will wait to see how long the Short tasks now take.
Here is one of the runs
20:35:05 (11352): wrapper (7.5.26012): starting
20:35:05 (11352): wrapper: running llr.exe ( -d -oPgenInputFile=input.prp -oPgenOutputFile=primes.txt -oDiskWriteTime=10 -oOutputIterations=50000 -oResultsFileIterations=99999999)
Base factorized as : 19*37
Base prime factor(s) taken : 37
Starting N+1 prime test of 758*703^297552-1
Using zero-padded FMA3 FFT length 448K, Pass1=448, Pass2=1K, a = 3
758*703^297552-1, bit: 50000 / 2814073 [1.77%]. Time per bit: 26.795 ms.
758*703^297552-1, bit: 100000 / 2814073 [3.55%]. Time per bit: 26.308 ms.
758*703^297552-1, bit: 150000 / 2814073 [5.33%]. Time per bit: 27.097 ms.
758*703^297552-1, bit: 200000 / 2814073 [7.10%]. Time per bit: 26.106 ms.
758*703^297552-1, bit: 250000 / 2814073 [8.88%]. Time per bit: 26.497 ms.
758*703^297552-1, bit: 300000 / 2814073 [10.66%]. Time per bit: 27.626 ms.
758*703^297552-1, bit: 350000 / 2814073 [12.43%]. Time per bit: 26.841 ms.
758*703^297552-1, bit: 400000 / 2814073 [14.21%]. Time per bit: 26.013 ms.
758*703^297552-1, bit: 450000 / 2814073 [15.99%]. Time per bit: 26.704 ms.
758*703^297552-1, bit: 500000 / 2814073 [17.76%]. Time per bit: 26.661 ms.
758*703^297552-1, bit: 550000 / 2814073 [19.54%]. Time per bit: 26.440 ms.
758*703^297552-1, bit: 600000 / 2814073 [21.32%]. Time per bit: 26.406 ms.
758*703^297552-1, bit: 650000 / 2814073 [23.09%]. Time per bit: 25.856 ms.
758*703^297552-1, bit: 700000 / 2814073 [24.87%]. Time per bit: 27.084 ms.
758*703^297552-1, bit: 750000 / 2814073 [26.65%]. Time per bit: 25.425 ms.
758*703^297552-1, bit: 800000 / 2814073 [28.42%]. Time per bit: 25.672 ms.
758*703^297552-1, bit: 850000 / 2814073 [30.20%]. Time per bit: 26.623 ms.
758*703^297552-1, bit: 900000 / 2814073 [31.98%]. Time per bit: 26.609 ms.
758*703^297552-1, bit: 950000 / 2814073 [33.75%]. Time per bit: 27.091 ms.
758*703^297552-1, bit: 1000000 / 2814073 [35.53%]. Time per bit: 26.606 ms.
758*703^297552-1, bit: 1050000 / 2814073 [37.31%]. Time per bit: 26.533 ms.
758*703^297552-1, bit: 1100000 / 2814073 [39.08%]. Time per bit: 26.849 ms.
758*703^297552-1, bit: 1150000 / 2814073 [40.86%]. Time per bit: 25.959 ms.
758*703^297552-1, bit: 1200000 / 2814073 [42.64%]. Time per bit: 27.298 ms.
758*703^297552-1, bit: 1250000 / 2814073 [44.41%]. Time per bit: 27.425 ms.
758*703^297552-1, bit: 1300000 / 2814073 [46.19%]. Time per bit: 25.425 ms.
758*703^297552-1, bit: 1350000 / 2814073 [47.97%]. Time per bit: 25.562 ms.
758*703^297552-1, bit: 1400000 / 2814073 [49.74%]. Time per bit: 25.964 ms.
758*703^297552-1, bit: 1450000 / 2814073 [51.52%]. Time per bit: 26.646 ms.
758*703^297552-1, bit: 1500000 / 2814073 [53.30%]. Time per bit: 25.772 ms.
758*703^297552-1, bit: 1550000 / 2814073 [55.08%]. Time per bit: 27.427 ms.
758*703^297552-1, bit: 1600000 / 2814073 [56.85%]. Time per bit: 26.181 ms.
758*703^297552-1, bit: 1650000 / 2814073 [58.63%]. Time per bit: 25.116 ms.
758*703^297552-1, bit: 1700000 / 2814073 [60.41%]. Time per bit: 26.883 ms.
758*703^297552-1, bit: 1750000 / 2814073 [62.18%]. Time per bit: 26.331 ms.
758*703^297552-1, bit: 1800000 / 2814073 [63.96%]. Time per bit: 26.972 ms.
758*703^297552-1, bit: 1850000 / 2814073 [65.74%]. Time per bit: 25.115 ms.
758*703^297552-1, bit: 1900000 / 2814073 [67.51%]. Time per bit: 26.664 ms.
758*703^297552-1, bit: 1950000 / 2814073 [69.29%]. Time per bit: 26.763 ms.
758*703^297552-1, bit: 2000000 / 2814073 [71.07%]. Time per bit: 26.566 ms.
758*703^297552-1, bit: 2050000 / 2814073 [72.84%]. Time per bit: 26.806 ms.
758*703^297552-1, bit: 2100000 / 2814073 [74.62%]. Time per bit: 26.683 ms.
758*703^297552-1, bit: 2150000 / 2814073 [76.40%]. Time per bit: 26.752 ms.
758*703^297552-1, bit: 2200000 / 2814073 [78.17%]. Time per bit: 27.012 ms.
758*703^297552-1, bit: 2250000 / 2814073 [79.95%]. Time per bit: 26.156 ms.
758*703^297552-1, bit: 2300000 / 2814073 [81.73%]. Time per bit: 26.435 ms.
758*703^297552-1, bit: 2350000 / 2814073 [83.50%]. Time per bit: 24.675 ms.
758*703^297552-1, bit: 2400000 / 2814073 [85.28%]. Time per bit: 26.937 ms.
16:18:04 (1204): wrapper (7.5.26012): starting
16:18:04 (1204): wrapper: running llr.exe ( -d -oPgenInputFile=input.prp -oPgenOutputFile=primes.txt -oDiskWriteTime=10 -oOutputIterations=50000 -oResultsFileIterations=99999999)
Base factorized as : 19*37
Base prime factor(s) taken : 37
Resuming N+1 prime test of 758*703^297552-1 at bit 2424321 [86.14%]
Using zero-padded FMA3 FFT length 448K, Pass1=448, Pass2=1K, a = 3
758*703^297552-1, bit: 2450000 / 2814073 [87.06%]. Time per bit: 30.263 ms.
758*703^297552-1, bit: 2500000 / 2814073 [88.83%]. Time per bit: 4.650 ms.
758*703^297552-1, bit: 2550000 / 2814073 [90.61%]. Time per bit: 4.728 ms.
____________
Crunching@EVGA The Number One Team in the BOINC Community. Folding@EVGA The Number One Team in the Folding@Home Community.
/ Reply
Quote
One did complete
Stderr output
<core_client_version>7.16.20</core_client_version>
<![CDATA[
<stderr_txt>
20:35:27 (235200): wrapper (7.5.26012): starting
20:35:27 (235200): wrapper: running llr.exe ( -d -oPgenInputFile=input.prp -oPgenOutputFile=primes.txt -oDiskWriteTime=10 -oOutputIterations=50000 -oResultsFileIterations=99999999)
Base factorized as : 19*37
Base prime factor(s) taken : 37
Starting N+1 prime test of 1902*703^298250-1
Using zero-padded FMA3 FFT length 448K, Pass1=448, Pass2=1K, a = 3
1902*703^298250-1, bit: 50000 / 2820675 [1.77%]. Time per bit: 22.311 ms.
1902*703^298250-1, bit: 100000 / 2820675 [3.54%]. Time per bit: 23.258 ms.
1902*703^298250-1, bit: 150000 / 2820675 [5.31%]. Time per bit: 22.240 ms.
1902*703^298250-1, bit: 200000 / 2820675 [7.09%]. Time per bit: 23.705 ms.
1902*703^298250-1, bit: 250000 / 2820675 [8.86%]. Time per bit: 23.563 ms.
1902*703^298250-1, bit: 300000 / 2820675 [10.63%]. Time per bit: 23.537 ms.
1902*703^298250-1, bit: 350000 / 2820675 [12.40%]. Time per bit: 23.417 ms.
1902*703^298250-1, bit: 400000 / 2820675 [14.18%]. Time per bit: 23.423 ms.
1902*703^298250-1, bit: 450000 / 2820675 [15.95%]. Time per bit: 24.154 ms.
1902*703^298250-1, bit: 500000 / 2820675 [17.72%]. Time per bit: 23.798 ms.
1902*703^298250-1, bit: 550000 / 2820675 [19.49%]. Time per bit: 23.287 ms.
1902*703^298250-1, bit: 600000 / 2820675 [21.27%]. Time per bit: 23.133 ms.
1902*703^298250-1, bit: 650000 / 2820675 [23.04%]. Time per bit: 23.226 ms.
1902*703^298250-1, bit: 700000 / 2820675 [24.81%]. Time per bit: 23.122 ms.
1902*703^298250-1, bit: 750000 / 2820675 [26.58%]. Time per bit: 23.659 ms.
1902*703^298250-1, bit: 800000 / 2820675 [28.36%]. Time per bit: 22.845 ms.
1902*703^298250-1, bit: 850000 / 2820675 [30.13%]. Time per bit: 23.728 ms.
1902*703^298250-1, bit: 900000 / 2820675 [31.90%]. Time per bit: 23.116 ms.
1902*703^298250-1, bit: 950000 / 2820675 [33.67%]. Time per bit: 23.231 ms.
1902*703^298250-1, bit: 1000000 / 2820675 [35.45%]. Time per bit: 23.582 ms.
1902*703^298250-1, bit: 1050000 / 2820675 [37.22%]. Time per bit: 23.281 ms.
1902*703^298250-1, bit: 1100000 / 2820675 [38.99%]. Time per bit: 23.319 ms.
1902*703^298250-1, bit: 1150000 / 2820675 [40.77%]. Time per bit: 23.632 ms.
1902*703^298250-1, bit: 1200000 / 2820675 [42.54%]. Time per bit: 23.302 ms.
1902*703^298250-1, bit: 1250000 / 2820675 [44.31%]. Time per bit: 23.006 ms.
1902*703^298250-1, bit: 1300000 / 2820675 [46.08%]. Time per bit: 23.358 ms.
1902*703^298250-1, bit: 1350000 / 2820675 [47.86%]. Time per bit: 23.691 ms.
1902*703^298250-1, bit: 1400000 / 2820675 [49.63%]. Time per bit: 23.544 ms.
1902*703^298250-1, bit: 1450000 / 2820675 [51.40%]. Time per bit: 23.089 ms.
1902*703^298250-1, bit: 1500000 / 2820675 [53.17%]. Time per bit: 23.863 ms.
1902*703^298250-1, bit: 1550000 / 2820675 [54.95%]. Time per bit: 22.802 ms.
1902*703^298250-1, bit: 1600000 / 2820675 [56.72%]. Time per bit: 23.750 ms.
1902*703^298250-1, bit: 1650000 / 2820675 [58.49%]. Time per bit: 23.554 ms.
1902*703^298250-1, bit: 1700000 / 2820675 [60.26%]. Time per bit: 23.052 ms.
1902*703^298250-1, bit: 1750000 / 2820675 [62.04%]. Time per bit: 22.702 ms.
1902*703^298250-1, bit: 1800000 / 2820675 [63.81%]. Time per bit: 23.200 ms.
1902*703^298250-1, bit: 1850000 / 2820675 [65.58%]. Time per bit: 23.419 ms.
1902*703^298250-1, bit: 1900000 / 2820675 [67.35%]. Time per bit: 23.284 ms.
1902*703^298250-1, bit: 1950000 / 2820675 [69.13%]. Time per bit: 23.145 ms.
1902*703^298250-1, bit: 2000000 / 2820675 [70.90%]. Time per bit: 23.006 ms.
1902*703^298250-1, bit: 2050000 / 2820675 [72.67%]. Time per bit: 23.630 ms.
1902*703^298250-1, bit: 2100000 / 2820675 [74.45%]. Time per bit: 23.580 ms.
1902*703^298250-1, bit: 2150000 / 2820675 [76.22%]. Time per bit: 22.959 ms.
1902*703^298250-1, bit: 2200000 / 2820675 [77.99%]. Time per bit: 23.984 ms.
1902*703^298250-1, bit: 2250000 / 2820675 [79.76%]. Time per bit: 23.219 ms.
1902*703^298250-1, bit: 2300000 / 2820675 [81.54%]. Time per bit: 24.151 ms.
1902*703^298250-1, bit: 2350000 / 2820675 [83.31%]. Time per bit: 23.219 ms.
1902*703^298250-1, bit: 2400000 / 2820675 [85.08%]. Time per bit: 23.083 ms.
1902*703^298250-1, bit: 2450000 / 2820675 [86.85%]. Time per bit: 23.232 ms.
1902*703^298250-1, bit: 2500000 / 2820675 [88.63%]. Time per bit: 23.493 ms.
1902*703^298250-1, bit: 2550000 / 2820675 [90.40%]. Time per bit: 23.387 ms.
1902*703^298250-1, bit: 2600000 / 2820675 [92.17%]. Time per bit: 23.384 ms.
1902*703^298250-1, bit: 2650000 / 2820675 [93.94%]. Time per bit: 23.570 ms.
1902*703^298250-1, bit: 2700000 / 2820675 [95.72%]. Time per bit: 23.000 ms.
1902*703^298250-1, bit: 2750000 / 2820675 [97.49%]. Time per bit: 23.586 ms.
16:19:36 (7296): wrapper (7.5.26012): starting
16:19:36 (7296): wrapper: running llr.exe ( -d -oPgenInputFile=input.prp -oPgenOutputFile=primes.txt -oDiskWriteTime=10 -oOutputIterations=50000 -oResultsFileIterations=99999999)
Base factorized as : 19*37
Base prime factor(s) taken : 37
Resuming N+1 prime test of 1902*703^298250-1 at bit 2742145 [97.21%]
Using zero-padded FMA3 FFT length 448K, Pass1=448, Pass2=1K, a = 3
1902*703^298250-1, bit: 2750000 / 2820675 [97.49%]. Time per bit: 130.595 ms.
1902*703^298250-1, bit: 2800000 / 2820675 [99.26%]. Time per bit: 5.090 ms.
1902*703^298250-1 is not prime. RES64: 17BB545F6A9208F1. OLD64: E5B85E83FD248463 Time : 64405.114 sec.
16:26:38 (7296): llr.exe exited; CPU time 413.375000
16:26:38 (7296): called boinc_finish(0)
</stderr_txt>
]]>
____________
Crunching@EVGA The Number One Team in the BOINC Community. Folding@EVGA The Number One Team in the Folding@Home Community.
/ Reply
Quote
Mine are also running for about 10 hours on my fastest pc, AMD 5800x, but they are taking over 30 hours on my slowest pc's, Intel Xeon running at 2.3ghz, but my main problem is the estimates for the 'time to completion' I'm getting for the tasks, 3 hours and 35 minutes!! It means I often end up aborting tasks I never even get to start before the deadline comes around. Yes I abort them and then get new tasks with a deadline of the day after those that I aborted. I have my cache settings set at 1 day plus 1/2 day additional and because they come in as going to only take about 3+ hours I get WAAAAY too many of them. I'm mostly talking about the Average3 tasks but the other time estimates while better aren't recognizing my pc's capabilities and reducing the amount of tasks I get accordingly. I thought this was a Project side setting to increase or reduce the amount of tasks sent to me based on my crunching X amount of tasks, does this Project not support that feature?
mikey
/ Reply
Quote
rebirtherVolunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Send message
Joined: 2 Jan 13
Posts: 7255
Credit: 42,729,227
RAC: 3
Mine are also running for about 10 hours on my fastest pc, AMD 5800x, but they are taking over 30 hours on my slowest pc's, Intel Xeon running at 2.3ghz, but my main problem is the estimates for the 'time to completion' I'm getting for the tasks, 3 hours and 35 minutes!! It means I often end up aborting tasks I never even get to start before the deadline comes around. Yes I abort them and then get new tasks with a deadline of the day after those that I aborted. I have my cache settings set at 1 day plus 1/2 day additional and because they come in as going to only take about 3+ hours I get WAAAAY too many of them. I'm mostly talking about the Average3 tasks but the other time estimates while better aren't recognizing my pc's capabilities and reducing the amount of tasks I get accordingly. I thought this was a Project side setting to increase or reduce the amount of tasks sent to me based on my crunching X amount of tasks, does this Project not support that feature?
mikey
That will always happening for new apps where the server has no datas to calculate for estimated runtime. BOINC has always 0 estimated runtime after you have some results sent back to the server. The time to completion will be corrected if you getting new tasks. If you cant do the tasks until deadline the WUs will be aborted by the server.
/ Reply
Quote
Mine are also running for about 10 hours on my fastest pc, AMD 5800x, but they are taking over 30 hours on my slowest pc's, Intel Xeon running at 2.3ghz, but my main problem is the estimates for the 'time to completion' I'm getting for the tasks, 3 hours and 35 minutes!! It means I often end up aborting tasks I never even get to start before the deadline comes around. Yes I abort them and then get new tasks with a deadline of the day after those that I aborted. I have my cache settings set at 1 day plus 1/2 day additional and because they come in as going to only take about 3+ hours I get WAAAAY too many of them. I'm mostly talking about the Average3 tasks but the other time estimates while better aren't recognizing my pc's capabilities and reducing the amount of tasks I get accordingly. I thought this was a Project side setting to increase or reduce the amount of tasks sent to me based on my crunching X amount of tasks, does this Project not support that feature?
mikey
That will always happening for new apps where the server has no datas to calculate for estimated runtime. BOINC has always 0 estimated runtime after you have some results sent back to the server. The time to completion will be corrected if you getting new tasks. If you cant do the tasks until deadline the WUs will be aborted by the server.
Yeah that last part happened to me for a few tasks today, sorry about that I usually try to do them a day early to get them back into the queue sooner.
/ Reply
Quote