Boinc Wraper-Worker Solution
Just started to look at it. And deployed “first try” on http://boinc.vgtu.lt. I’ll try to move the complete project to use this scheme. If everything will go fine the first non test application will be deployed soon…
February 25, 2008
August 8, 2006
vtu@home workunit result validator problem
The validator sudenly stopped to validate results. After two weeks of search i’ve found out a problem. There was a host with a very big amount of credits granted. I don’t know how this happened, but the amount was something like 1.556456465465446545+e88. It is a very huge number of credits. Tha validator was allways to fail, if the workunit being validated, contained a result from this host. I’ve just deleted all the results from this host and all the set host credits to zero. The validator started to work. Sorry for bad experience.
Keep on good work dear contributors. I’ll try to help you to help us…
June 13, 2006
vtu@home boinc project
The project http://boinc.vtu.lt/vtuathome/ is a test project. It is developed to test the BOINC platform and to learn the BOINC API. The project is still incomplete and your notes, suggestions and comments are appreciated.
The aim of the project is to count the quantity of prime numbers in a large interval. The worst algorythm is used, as we need a lot of computing hours and many workunits. The client side application gets the beggining and the end numbers of the interval and divides every number from this interval by every number from 1 to it self. As we know there are better algorythms:
1. To divide the current number only by every number from 1 to sqrt(itself);
2. To divide the current number only by every known prime number from 1 to sqrt(itself); This one is the best known algorythm. In some modifications division operation can be changed into some set of sum operations.
We have some plans for future:
1. To use the platform to solve a wire bundle parametrical optimization problem
2. To use the platform to solve medicine research problems
3. To use the platform to solve any interesting suggested problem. Your suggestions are also appreciated.
Thank you fellows for help and contribution.