Message boards :
News :
The last bunch of tasks were generated
Message board moderation
Author | Message |
---|---|
Send message Joined: 11 Aug 17 Posts: 650 Credit: 22,653,530 RAC: 13,496 |
Dear folks! A few hours ago we generate the last bunch of tasks R10 search. The search is close to completion, after which its results will be processed and uploaded for public access. Thank you for donation of CPU Time, attention for the project and participation! The volunteer distributed computing is amazing feature of out time! Thank you! |
Send message Joined: 11 Sep 17 Posts: 51 Credit: 194,459,015 RAC: 5,067 |
😞.. yes but we all do fantastic job for this project. Hope see soon again here 😎 |
Send message Joined: 6 Dec 17 Posts: 17 Credit: 268,215 RAC: 1 |
I hope the project will resume at some point - I just resumed distributed computing recently and there are still badges I wish to collect here ;) Thank you! |
Send message Joined: 11 Aug 17 Posts: 650 Credit: 22,653,530 RAC: 13,496 |
Thank you, folks! :) |
Send message Joined: 11 Aug 17 Posts: 103 Credit: 1,973,929 RAC: 15 |
Thank you people! It is a great experience for me to co-administrate a BOINC project. It was very supportive of you to give feedback and encourage us during these years. |
Send message Joined: 23 Nov 17 Posts: 47 Credit: 27,378,854 RAC: 6 |
I am a bit baffled. If I remember correctly, it was said before that the R10 search space would never be finished completely and now the project is over entirely? What happened? Michael. President of Rechenkraft.net. Fördern, kooperieren und konstruieren statt fordern, konkurrieren und konsumieren. |
Send message Joined: 21 May 20 Posts: 1 Credit: 115,646 RAC: 0 |
Вот после этого обновления задания уже второй день не приходят. Считаются пока другие проекты. И принудительно не помогает и очистка кэша... |
Send message Joined: 1 Jan 18 Posts: 10 Credit: 706,956 RAC: 338 |
Your initial posting that the last batch of WU's had been distributed implied that the RakeSearch project was coming completely to an end, but did not actually say that it was. For clarity please state if we should expect any future projects / applications from RakeSearch or it we are free to remove the whole project from our BOINC clients. Thanks Bill F Dallas TX |
Send message Joined: 11 Aug 17 Posts: 103 Credit: 1,973,929 RAC: 15 |
R10 search was initially planned as partial. We aimed at trying what it would give with understanding that it will cover only a small part of the search space (see the initial post). Now we have covered that part and found a number of pairs with high degrees of orthogonality (but no 100% orthogonal). The statistics on these pairs is published and hopefully will be used by other researchers. As soon as the last tasks are finished, the RakeSearch project is ended. We plan to keep alive the website and the forum. |
Send message Joined: 11 Aug 17 Posts: 103 Credit: 1,973,929 RAC: 15 |
Вот после этого обновления задания уже второй день не приходят. Считаются пока другие проекты. И принудительно не помогает и очистка кэша... Потому что задания закончились и проект завершается :) Досчитываются только недостающие до кворума. |
Send message Joined: 11 Aug 17 Posts: 650 Credit: 22,653,530 RAC: 13,496 |
bluestang, what do you mean? |
Send message Joined: 11 Aug 17 Posts: 103 Credit: 1,973,929 RAC: 15 |
Hi bluestang, I am not the same person as Natalia Makarova of ODLK projects if you mean that. It is really confusing, because there are few women in BOINC, but I am completely different person. The name is very common in Russia. I hope that my communication with crunchers was never rude. |
Send message Joined: 12 Jun 18 Posts: 14 Credit: 20,011,948 RAC: 1,302 |
Oh, well that's good to hear that you are not one in the same Natalia. Sorry for not realizing that and accept my apology and thanks. And it sounds like you're aware of her antics then lol. Was so close to hitting 20Mil in points too. Good luck in you next adventures and hope to see all you bring on another project as the admins here really were on top of things and always responsive. |
Send message Joined: 18 Dec 17 Posts: 3 Credit: 522,455 RAC: 767 |
Well crap... I guess we crunch, crunch, crunch nom, nom, nom, gulp, gulp, gulped all the Wu's bye -bye!!! Thanks for a lot of fun and I hope to see a follow-up project start here. Until then, Aloha! Thanks, Boogyman Munster |
Send message Joined: 4 Mar 20 Posts: 1 Credit: 174,601 RAC: 0 |
Spaseeba. It was good to search the R10 space. Since the estimated number of workunits for RakeSearch R10 for the entire search space is ~ 212.963.246.290.200 workunits and the current run covered 1.024.000 workunits that means only 0,000000481% of the R10 "expanse" was searched. Hopefully there will be somebody that will pick up the endeavour to light up the R10 space. |
Send message Joined: 11 Sep 17 Posts: 51 Credit: 194,459,015 RAC: 5,067 |
Spaseeba. Yes, but computers are every year stronger and better. Soo if they wait , that can be better after all for computing this numbers )) no joke, Amd promise next 2-4 years 128 core cpu, zen 5 on 3+nM arch. ,, do you remmeber when amd introduce 3990 cpu Lisa-amd ceo say: "best things will just comminig"... on acctuall cpu-die witch is really big.. Key for rakesearch in future (if they comback) is make optimised app, witch use much better resources from cpu s , or make gpu version but its really heavy ,, And maybe rakesearch have to add last badge,,, some special honorary badge witch will replace june badge, , like thank for alll work )) |
Send message Joined: 8 Sep 17 Posts: 99 Credit: 402,603,726 RAC: 0 |
It is sad to see good project ending. I hoped that new search for Rank 11 would be started soon. When I was working on optimized app for R10, I found another possible optimization - check and eliminate rows with duplicated pairs early, in similar way as app is eliminating duplicate values on diagonal. I created a small proof of concept using __uint128_t type. When app was looking for fully orthogonal pairs, it was 2.6 times faster (this probably could be improved). Unfortunately for R10 app is looking for partially orthogonal pairs, so another approach was required, and it was 30% slower. I recall that you wrote that it is easier to find orthogonal pairs for odd ranks than even ones, so I hoped that I could use it for R11 search. I also started work on GPU app. So far results were not spectacular (about 3 times faster on Nvidia 1070), but there is room for optimization. I hope that you will reconsider running R11 search :) |
Send message Joined: 8 Sep 17 Posts: 7 Credit: 1,000,750 RAC: 12,186 |
It is sad to see good project ending. I hoped that new search for Rank 11 would be started soon. When I was working on optimized app for R10, I found another possible optimization - check and eliminate rows with duplicated pairs early, in similar way as app is eliminating duplicate values on diagonal. I created a small proof of concept using __uint128_t type. When app was looking for fully orthogonal pairs, it was 2.6 times faster (this probably could be improved). Unfortunately for R10 app is looking for partially orthogonal pairs, so another approach was required, and it was 30% slower. I recall that you wrote that it is easier to find orthogonal pairs for odd ranks than even ones, so I hoped that I could use it for R11 search. I also started work on GPU app. So far results were not spectacular (about 3 times faster on Nvidia 1070), but there is room for optimization. I hope that you will reconsider running R11 search :) so go ahead and do your project boinc. we're here. |
©2024 The searchers team, Karelian Research Center of the Russian Academy of Sciences