![]() |
![]() |
#12 | |
"6800 descendent"
Feb 2005
Colorado
74610 Posts |
![]() Quote:
On my local machine, an instance of Prime95 running ECM curves does indeed update the save file(s) when it is interrupted. However, with mprime running curves on Colab with Google Drive connected and used for storage, the save files(s) are not updated upon a program interruption. This behavior might be different with other types of save files. |
|
![]() |
![]() |
![]() |
#13 | |
If I May
"Chris Halsall"
Sep 2002
Barbados
1130110 Posts |
![]() Quote:
If the latter... My observations (under both Colab and Kaggle) are that the "kills" are instant (and painless). No notification by way of SIGINT, SIGHUP, etc. It's like a virtual plug is pulled out of the wall kinda situation. I remember under AWS/EC2 there was a way of getting something like a two minute warning for their interruptable instances. Definitely not here. |
|
![]() |
![]() |
![]() |
#14 | |
"6800 descendent"
Feb 2005
Colorado
2·373 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#15 | |
"Curtis"
Feb 2005
Riverside, CA
3·13·149 Posts |
![]() Quote:
That is, larger-bound curves also find factors smaller than the targeted size. That's why we move forward into larger bounds even when there's a 1/e chance we missed a factor; the larger curves will find it, while also having a chance to find larger factors. |
|
![]() |
![]() |
![]() |
#16 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
24×643 Posts |
![]()
I think OP's question was more along the line "why don't we do directly the B1=250k curves, if the smaller don't contribute to the probability?". But if you play a while with ECM and count how long one curve at each level takes, you see why.
|
![]() |
![]() |
![]() |
#17 | |
If I May
"Chris Halsall"
Sep 2002
Barbados
3·3,767 Posts |
![]() Quote:
I ran an experimental ECM from Primenet's Manual assignment page -- got 13082789,-1,50000,5000000,50. One curve took ~35 minutes on a i5-7400 @ 3G. Likes it's memory -- used something like 8GB during stage 2. Checkpoints were 3.2M. Quick question: is there any problem submitting a smaller number of curves than assigned? I understand there's no "toe-stepping" here -- every curve is run from a random seed. I'm more wondering about the server-side of things -- is it going to pollute the Primenet DB table(s) with a needless level of record keeping? An initial impression is this should be fairly trivial to deploy in a "percisistanceless payload" style setting. The checkpoints are small enough to not be a problem sending back every 30 or even 10 minutes. The CPUs available, while GPUs are running, are going to take something like two hours or so on a similar job, so there's no chance the requested 50 curves are going to run during one instance lifetime (or several, for that matter). Last fiddled with by chalsall on 2019-10-31 at 06:21 Reason: s/Took/One curve took/; # What's 1.5 orders of magnitude between friends! |
|
![]() |
![]() |
![]() |
#18 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
283016 Posts |
![]()
Can't answer about how overloaded the server will be with that (probably insignificant, but server's gods have to confirm that), but technically there is no problem in reporting more or less curves than you reserved. I did this in the past (reporting one curve, or 10, when I was reserving the default 3). The assignment is gone when the assigned number is fulfilled.
Last fiddled with by LaurV on 2019-10-31 at 06:37 |
![]() |
![]() |
![]() |
#19 | |
"GIMFS"
Sep 2002
Oeiras, Portugal
2·7·113 Posts |
![]() Quote:
The default saving interval is 30 minutes, but I have already lowered it to 10 to reduce the chances of loosing a substancial amount of work. It can be done adding the line DiskWriteTime=nn to the prime.txt file, resident in the mprime folder. Yes, absolutely. Virtually all the work I´m currently doing is non-nominal. You know, after 17 years with the GIMPS project you feel like being a bit "creative" to avooid getting tired, so I started setting some personal goals and change them from time to time, depending on my mood and, of course, available resources. Last fiddled with by lycorn on 2019-10-31 at 11:43 |
|
![]() |
![]() |
![]() |
#20 | |
"Bob Silverman"
Nov 2003
North of Boston
2×3,779 Posts |
![]() Quote:
https://www.ams.org/journals/mcom/19...993-1122078-7/ "A Practical Analysis of The Elliptic Curve Factoring Algorithm" It tells you everything you might ask. BTW, I would include the .pdf in this post, but I don't know how to insert the whole .pdf file. |
|
![]() |
![]() |
![]() |
#21 | |
If I May
"Chris Halsall"
Sep 2002
Barbados
3·3,767 Posts |
![]() Quote:
Why? That sounds like a design flaw to me. I haven't actually attached a drive to an instance for several weeks. I now have a "throw-away" account I can use to run some experiments. Over the weekend I'll look at this, as well as test if "rm -rf /content/drive/" does what I think it might... ![]() Last fiddled with by chalsall on 2019-11-01 at 16:38 Reason: Extra " -- code didn't compile. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
PRP vs LL speed comparison and probabilities | JuanTutors | Software | 6 | 2019-07-27 03:15 |
Missing bit levels? | NBtarheel_33 | Data | 6 | 2016-05-31 15:27 |
skipped bit levels | tha | PrimeNet | 151 | 2016-03-17 11:38 |
Some transition probabilities | fivemack | Aliquot Sequences | 9 | 2012-03-16 08:49 |
Recommended TF bit levels for M(>10^8) | NBtarheel_33 | Math | 19 | 2008-11-03 17:19 |