mersenneforum.org  

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

Closed Thread
 
Thread Tools
Old 2004-07-02, 17:03   #12
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

22·3·401 Posts
Default

Quote:
Originally Posted by S00113
I think we should take another approach to handing out work.
You assume that everyone joining the project has read the user manual and is able to select number of hours and kind of reservation.

I don't think so. Many people use to start an application just clicking on it, and to forget about it. They usually put default values in the boxes just to see "if it works".

To get rid of long-standing exponents, I think there should be an automated algorithm to calculate the effective CPU daily work, and request exponents based upon that algorithm.

Luigi
ET_ is offline  
Old 2004-07-02, 18:45   #13
I_like_tomatoes
 
I_like_tomatoes's Avatar
 
Oct 2003
Canada

1011112 Posts
Default

Quote:
Originally Posted by S00113
And let the server deny requests for exponents which will take more than 120 days or so to complete.
What about people with slower computers that want to look for primes that are larger then the ones yet discovered?
Sure, it'll take forever for somebody with a 386 to do an LL test on a number bigger then M41, but if it isn't slowing somebody else's progress down, we shouldn't stop them.
If you're going to deny the longer requests, at the very least let anybody who wants tackle the longer exponents (although perhaps give them a warning that it'll take a while if it's going to take more then six months or so). They won't be slowing down the countdowns - in fact, it would speed up the countdowns by letting someone with a faster computer have a go.
I_like_tomatoes is offline  
Old 2004-07-02, 19:03   #14
patrik
 
patrik's Avatar
 
"Patrik Johansson"
Aug 2002
Uppsala, Sweden

6518 Posts
Default

Yes, assigning first time tests to the slowest computers may be a good idea since it would prevent them from holding up any milestones. (The "tested once" milestones are really not very important since we have so many errors.) And assigning first time tests to the REALLY slowest computers may prevent them from holding up any milestones for the first four years, or so.
patrik is offline  
Old 2004-07-02, 19:05   #15
Matthias C. Noc
 
Matthias C. Noc's Avatar
 
Dec 2003

23×3 Posts
Default

Quote:
Originally Posted by S00113
It is very discouraging when you find that the exponent you have been working on the last four months was poached...
Four month would be no problem, I was talking about those who need years or how nfortino wrote "only one has a chance of finishing in a semi-finite amount of time".

Quote:
Originally Posted by S00113
think we should take another approach to handing out work. Let us decide how large exponents we want by the number of days it will take to complete it, and hand out exponents in lots of different ranges at the same time. This will let everyone make steady progress and see exponents complete regularly at the speed he or she decide. And let the server deny requests for exponents which will take more than 120 days or so to complete.
Yes, something like that would be good. I think a stricter expiration rule might do the trick too, e.g. if procress per week on a small exponent is not bigger than 5 % (except holidays), then a warning should be send, after three warnings the exponent should expire and returned to the pool.

Quote:
Originally Posted by I_like_tomatoes
What about people with slower computers that want to look for primes that are larger then the ones yet discovered?
Sure, it'll take forever for somebody with a 386 to do an LL test on a number bigger then M41, but if it isn't slowing somebody else's progress down, we shouldn't stop them.
If you're going to deny the longer requests, at the very least let anybody who wants tackle the longer exponents (although perhaps give them a warning that it'll take a while if it's going to take more then six months or so). They won't be slowing down the countdowns - in fact, it would speed up the countdowns by letting someone with a faster computer have a go....
If one isn't holding up the progress I see no problem at all. In the higher ranges one year or more to complete won't matter in the foreseeable future. So there is no problem.

Best,

Matthias C. Noch
Matthias C. Noc is offline  
Old 2004-07-02, 20:14   #16
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

113148 Posts
Default

Quote:
Originally Posted by Matthias C. Noc
If one isn't holding up the progress I see no problem at all. In the higher ranges one year or more to complete won't matter in the foreseeable future. So there is no problem.
Apart from discovering M42 with one year of delay...

Luigi
ET_ is offline  
Old 2004-07-02, 21:11   #17
Matthias C. Noc
 
Matthias C. Noc's Avatar
 
Dec 2003

308 Posts
Default

Quote:
Originally Posted by ET_
Apart from discovering M42 with one year of delay...
Yes, maybe, but it will take a lot of time to prove that M42 is really M42 and not M44. IMHO the real worth of this project is that we are checking all exponents, and are not just adding some new, but isolated M-primes.

Best,

Matthias C. Noch
Matthias C. Noc is offline  
Old 2004-07-02, 22:22   #18
Primehack
 

2,707 Posts
Exclamation

I think you are forgetting something very important.

This is a proyect we are all contributing as a TEAM, and I think we need everybody contribution. The sum of all contributions is what gives this proyect its impressive computing power...

If you think your supercomputers (which btw I really don't think you have) can do this work alone then please don't bother everybody else: Become LMHs and enjoy your superb speed.

Best Regards,
EMC
 
Old 2004-07-06, 10:47   #19
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

769210 Posts
Default

Quote:
Originally Posted by Matthias C. Noc
Hi,

you asked what harm slow-completer are causing. I have three points:
(... each of which explains how impatient people can affect the project, but none of which demonstrates any effect on the project by the slow-completers themselves, which is what I asked for! :-)
Quote:
1.) The project is not only about <..snip..> If it takes years to finish one small exponent, which under today’s normal performance would take only 4 of 5 days to calculate, it is holding up the whole process without need.
No, it isn't!!

Let's say the fast machine does the small exponent in 4 days, while the slow machine does it in 400 days. Then their relative speeds are 100 and 1. With the fast machine alone, total speed of GIMPS progress is 100 speed units. With both machines, total speed of GIMPS progress is 101 speed units, which is 1% faster. The slow machine is speeding up GIMPS, not slowing it down.

If the slow machine were not taking care of exponent A it is working on, the fast machine would have to be diverted from working on a different exponent B in order to take care of exponent A. That (i.e., elimination of the slow machine's contribution) would hold up the project for the time it would take the fast machine to work on exponent A instead of exponent B! It is the elimination of the slow machine, not its participation, that would hold up the project!

Who would advance the work on exponent B while the fast machine worked on exponent A? Do you ever take that into account?

It seems to me that the objectors to the slow-completers systematically overlook that if the slow-completers were not participating, faster machines would have to be diverted from other work in order to perform the work that the slow machines would have performed, thus slowing down progress on the exponents that the faster machines would otherwise have been doing.
Quote:
That doesn’t help to get a better understanding of the distribution of those Mersenne primes.
Tell us how slowing GIMPS progress from a speed of 101 to a speed of 100 helps to get a better understanding of the distribution of Mersenne primes than continuing at speed 101 would get.
Quote:
2.) It makes a bad impression about the organisation of the project when we can’t finish a data range in an acceptable amount of time.
What is that acceptable amount of time? Who defines the acceptable amount? Will you admit that your argument is only about the emotions of impatient people, not about any real harm done by the slow-completers?
Quote:
We are crunching very large numbers, but fail to finish much smaller exponents. That doesn’t look good.
But we haven't failed to finish any much smaller exponent!! If you disagree, tell us one exponent which this project has "failed to finish". Note that that can't include any exponent on which work is currently in progress, or else you're declaring that all of the thousands of assignments which are not yet completed are ones that we are "fail[ing] to finish". If you're saying that all the thousands of currently uncompleted assignments are failures to finish exponents, then your argument doesn't seem to be worth anything.
Quote:
3.) We are doing a very abstract stuff here. To keep people motivated one needs to reach small and big milestones from time to time. As we don’t find a new Mersenne every month other milestones have to keep people interested.
Okay. For the purposes of this discussion, I'll accept that.

But ever since this project's beginning, we have been reaching small and big milestones all along, despite the participation of those darned slow-completers. In fact, the slow-completers have been helping GIMPS reach those milestones 1% or 2% faster than we would have without their help.
Quote:
Countdown to testing all exponents below M(13466917) once: 4
Countdown to testing all exponents below M(20996011) once: 9,549
Countdown to testing all exponents below M(24036583) once: 42,739
Countdown to proving M(13466917) is the 39th Mersenne Prime: 39,154
Countdown to proving M(20996011) is the 40th Mersenne Prime: 204,395
Countdown to proving M(24036583) is the 41st Mersenne Prime: 271,351
... and GIMPS will reach each of those milestones, just as it has been reaching earlier milestones all along.
Quote:
If we loose one normal cruncher with an up-to-date PC due to frustration about no progress
No progress? What do you mean no progress? GIMPS is making progress every day, so why do you write about "no progress"?

... and I note again that your argument is about the feelings of impatient people, not about any real harm done by slow completers. I'm not saying feelings are unimportant -- I'm saying that although I asked for arguments about real harm by slow completers, so far all I've gotten are arguments about feelings of impatient people. I just want folks to call a spade a spade.
Quote:
we are loosing much more power then when we loose 10 angry slow-crunchers because their exponents were reassigned in time to keep the project rolling.
But the project is rolling. I haven't yet seen you offer any evidence that it isn't!!
Quote:
It will close to be impossible to keep the project running in the much higher areas with only slow-completers.
Why do you exaggerate? No one except you has said anything about running the project with only slow-completers.

Can't you tolerate the participation of a small percentage of slow-completers? Neither I nor anyone else has proposed that slow-completers would constitute a large proportion of participants -- it just ain't gonna happen. So what's your worry?
Quote:
We need as much high-power as we can get now that we really working big numbers.
I agree.

So why don't the folks with high power simply just continue to participate as they have been?

Do you want to lose 1-2% (or whatever it is) of GIMPS speed by eliminating the slow-completers?
cheesehead is offline  
Old 2004-07-06, 21:02   #20
Primehack
 

22FF16 Posts
Thumbs up

Cheesehead, you have stated in a far more clever way my point of being a team.

I completely agree with you.
EMC
 
Old 2004-07-07, 19:06   #21
dsouza123
 
dsouza123's Avatar
 
Sep 2002

29616 Posts
Default

Back to the main issue, what is the projected time for the last 4 to finish ?

Years or months ? Or an aproximate date.
dsouza123 is offline  
Old 2004-07-07, 19:06   #22
JuanTutors
 
JuanTutors's Avatar
 
Mar 2004

1FD16 Posts
Default

I think it's fair to say that, had it not been for the slow computers, we would not know that M24036583 is prime. Personally, I don't see any way for us to have gotten to test M20996011 either if it weren't for those "slow computers".

Plus, if you have 1000 slow computers running at the same rate as 100 new, fast computers, then those 1000 slow produce the same quantity of results in a given time as the fast 100. Since the slow 1000 are also not working synchronously, they are producing results just as if they were the fast 100, and really the only difference between the slow 1000 and fast 100 is the quantity of numbers that are being worked on. Were it not for the fact that this program's creators have allowed us to have access to information about specific numbers, it would be completely impossible to tell the difference between numbers done by slow and fast computers. (In other words, other computer speeds are irrelevant if you don't know their speeds, making their speed irrelevant even if their speed is known.)


Plus, if you need one supreme, nonmathematical reason, let it be that you joined a project that its creators wanted everyone to be able to participate and help in, independent of how much they could do in any given amount of time.
JuanTutors is offline  
Closed Thread

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
No assignments available? dh1 GPU to 72 5 2016-10-10 03:36
Can't get new assignments keiken GPU to 72 2 2015-07-28 13:50
about assignments savoie Information & Answers 3 2015-04-30 10:07
Where did all the LL assignments go? petrw1 PrimeNet 34 2007-05-30 19:52
Old assignments brunoparga Operation Billion Digits 6 2006-12-28 20:34

All times are UTC. The time now is 07:35.

Fri Apr 23 07:35:09 UTC 2021 up 15 days, 2:16, 0 users, load averages: 2.38, 2.45, 2.30

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.