![]() |
|
|
#12 |
|
Sep 2004
283010 Posts |
After a few minutes of wise thinking I decided to leave this conversation. I really don't care how many servers will be available when I can manually reserve ranges. I'm hosting 2 NPLB servers, after they dry I am out. I'm reaching a point where I am tired of human stupidity so I prefer to walk away and silently crunch the manual ranges.
Carlos Last fiddled with by em99010pepe on 2008-02-28 at 17:08 |
|
|
|
|
#13 | |
|
May 2007
Kansas; USA
1039510 Posts |
Quote:
k=300-400 will be the same way. Higher priority on higher n-range at first for same reason followed by higher priority on the lower n-range to clean it up. I wouldn't want to dictate to people that they have to search the lower range until we get the 'mess' cleaned up. ![]() The main thing that I'm the happiest about is that people WANT to clean up the lower-range 'mess'. It was a concern of mine when the project started that it would be difficult to get people to search non-top-5000 ranges. THANKS TEAM!!Gary |
|
|
|
|
|
#14 |
|
May 2007
Kansas; USA
33×5×7×11 Posts |
I renamed this thread to 'Follow up on LLRnet servers needed' for future historical reference.
|
|
|
|
|
#15 | |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
Quote:
Okay, here's a new idea I'm putting up for discussion: Maybe here's what we should do: have one LLRnet server for a higher range, one LLRnet server for a lower range, and maybe one server for the n>600K testing later on. (The doublecheck server should probably be counted separately, because it's dealing with a wholly different type of work.) We don't necessarily need a server for each of those ranges on both 300<k<400 and 400<k<1001; instead, maybe we should have those three respective servers doing whichever k-range needs the most work for their designated n-range. As long as we host our servers on machines such as IronBits' that can handle the stress of a rally without breaking a sweat, then we shouldn't need "backup" servers on any of the ranges. That would keep logistical issues to a minimum, and avoid spreading our resources too thin, while still giving people plenty of choice as to n-ranges. Remember, as Mini-Geek said, most people won't care whether they're doing 300<k<400 or 400<k<1001, though they will care which n-range they're doing. What does everyone think? Anon
|
|
|
|
|
|
#16 |
|
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
(There's so much server discussion on this forum so forgive me if this has been said.)
At the beginning of the double check, cores could be returning results every few seconds. Would a server cope and how much time would the client waste with all the comms? Would reserving work units be better at the beginning? |
|
|
|
|
#17 | |||
|
May 2007
Kansas; USA
33·5·7·11 Posts |
Quote:
Quote:
We would want a server specifically on k=300-400 for n>333.3K for a rally the weekend of the 8th. But when n=300-400 'catches up' with n=400-1001, I can merge the big sieve file together and we can all work in harmony on the top-5000 range by itself with a single server for it (with a backup available if necessary). It may catch up with just the rally because it's < 1/6th as many k's. So perhaps temporarily, we could have 2 servers for n>333.3K; one for each k-range, with the idea of merging the range later. Or...as Anon said, just move the high-range server to k=300-400 until it gets caught up and not have one for k=400-1001. For k=400-1001 n<333.3K, we could just leave one server on that range and when it's done, move the server over to k=300-400 n<333.3K until it is done. Quote:
Gary |
|||
|
|
|
|
#18 | ||
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts |
Quote:
Quote:
I don't know how hard OOo or Excel would choke on a file as large as what we're dealing with, but you could always dump it in (make it .csv then make a space be the divider, or find/replace the space by a comma...this also works for looking at timings in lresults.txt), then sort it that way...Or you could just have it sort where the two ranges overlap, instead of dealing with the entire thing at once. |
||
|
|
|
|
#19 | |
|
May 2007
Kansas; USA
1039510 Posts |
Quote:
Interesting idea. I like it. The only issue is that before we did that, I think we'd want to run the current LLRnet servers dry so that we aren't sitting there with a bunch of gaps for k=400-1001. I don't think we could finish that up by the 8th because most people are on n<320K right now. So to incorporate and summarize your idea, here's what I think we'd need to do: 1. Have a temporary 2nd high-range server that exists only for the rally for k=300-400 n>333.3K AND until no more gaps exist in current LLRnet reservations for k=400-1001 n>333.3K. 2. After #1 is done, regardless of what n-range the two k-ranges are at, merge the two together and continue. Since they will be sorted by n, the k-range that has been searched the least will be searched until it is caught up. Gary |
|
|
|
|
|
#20 |
|
Oct 2006
1000000112 Posts |
here are my 2 cents ... (i forgot to read everything above)
in the long term, the project only need 2 server
to go to this place, we need to level up all files to join the same level ! first thing to do: sieve all sieve files to the same level so that we can merge all files to make only one big file. we don't really need more than 2 server in every case. we don't need to split the load if server are stable (IB one seems to handle the load) at the moment, the two stable servers needed are: - n=>333333 to find top 5000 primes (in range 1<k<1001) - n=<333333 to complete all the gaps in range 1<k<1001 once all the gaps bellow 333333 are filled, we can switch this server to release double check tests ... (not really important at the moment) this will limit the numbers of server to a maximum of 2 and the choice will be clear for everybody: 2 choices: top5000 primes or "clear Gary's mess" (this last one changing over time to "delation: mr X didn't check this file perfectly") i think that's what carlos was trying to explain. the division in k ranges (0-300 300-400 400+) is not usefull for llring (just complicating the reservation pages.) it's usefull for sieving (sr2sieve can't manage 500+ k numbers) but only for sieving ! we have to equalize everything to have a clear project ! as for the double check server: i will start one here limited to my home farm, it will clear all the low values (fast results hitting a server). once Gary's mess is cleared (every k/n pairs below n= 333333 tested once for every k< 1001) i will release the knpairs.txt file to the official llrnet double check server owner to let everybody crunch it. but first: CLEAR GARY'S MESS Last fiddled with by tnerual on 2008-02-28 at 21:57 |
|
|
|
|
#21 |
|
Mar 2006
Germany
55308 Posts |
about Ex*el and the row-limits:
you have to think 3-dimensional. i know E* can only load 65535 rows in one spreadsheet but what about more than one? i make my VBAscripts to summarize the k/n-pairs for users/teams, ranges and daily stats in such a manner that all spreadsheets named 'ResultsXXX' are summurized. before that i convert the LLRnet pairs in semicolon-seperated text files with the data i need with gawk (easy and quick). import this in E* and call the macro: that's all. and without a DB it's the fastest way i can do. and the most independed one. the most work i got to do is to eliminate/correct 'false' usernames and make the changes in the html-pages. the last could be done by creating a spreadsheet/textfile to write the data i need in html-code. that's my next step to do. |
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| LLRnet and PRPnet servers for automated LLR | mdettweiler | Twin Prime Search | 235 | 2021-05-13 21:13 |
| LLRnet servers for NPLB | kar_bon | No Prime Left Behind | 1343 | 2014-08-20 09:38 |
| LLRnet servers for CRUS | gd_barnes | Conjectures 'R Us | 39 | 2008-07-15 10:26 |
| New LLRnet servers discussion | IronBits | Conjectures 'R Us | 11 | 2008-03-20 03:43 |
| LLRnet servers needed | gd_barnes | No Prime Left Behind | 63 | 2008-03-01 03:36 |