About VGTU project@Home
The aim of this project is to provide a powerful distributed computing
platform for scientists of
Vilnius Gediminas
Technical University (VGTU) as well as others Lithuanian academic
institutions. The project is being run by a group of scientists from VGTU
Our goal is to persuade scientists to use this kind of computations in their
research and to assist them in preparing BOINC applications.
We hope that scientific applications from various fields will be attractive
to many current and future BOINC community volunteers and this will allow us
to accumulate enough computing resources to achieve significant (unachievable
otherwise) results.
Here you can find the description of the
current application. You can participate
in the project as volunteer if you agree to share your computer power with us to
solve these scientific problems. You can do this by downloading and running a free
program on your computer. Check below how to join the project.
Join VGTU project@Home
Returning participants
Community
|
User of the day
eLPeCKo I am young technology fan and I decided to donate some money for electricity and compute power to science.
HERE more about what I compute and about my... |
News
SSL enabled for VGTU@Home project server
Dear VGTU@Home users,
We have obtained from our university SSL certificate for our project server. Trying to minimize configuration efforts, all non-SSL traffic to http://boinc.vgtu.lt is now redirected to https://boinc.vgtu.lt.
Now, the communication during login is protected from the man-in-the-middle attacks.
We have also changed project’s scheduler URL.
However, at the moment, we do not plan to change project’s master URL.
Please, inform us in case of problems. Some problem could be expected with older internet browsers and BOINC clients.
With best regards,
The Project Team.
13 Oct 2016, 13:19:08 UTC
· Comment
Paper accepted for publication
Dear VGTU@Home users,
We are glad to share with you the news that our paper "Application of distributed parallel computing for dynamic visual cryptography" has been accepted for publication in Journal of Supercomputing. We will post the link to the article as soon as it will be available on the journal site.
With best regards,
The Project Team.
27 Apr 2016, 16:12:15 UTC
· Comment
New problem #3 to solve
Dear VGTU@Home users,
We start solving the new problem. We have again increased the problem size. The speed of computations is increasing. Solving previous problem it was reaching 4.5 TeraFLOPS. The optimal solution was found in workunit solved by user RDC from the BOINC Synergy team.
As always, we thank our users for active participation, especially our top users. We are glad to inform that our university has agreed to test the usage of computers from the two classrooms in our project. You can see their contribution under the user ITSC from the VGTU team.
7 Mar 2016, 11:59:30 UTC
· Comment
Finishing solution of the problem #2
Dear VGTU@Home users,
All workunits of the current problem have been generated and sent. Now we wait for all results to return back to the project server. We remind that our problem is a global optimization problem; therefore even last workunits potentially can produce the optimal solution. So we ask not to cancel them…
2 Mar 2016, 13:02:48 UTC
· Comment
New problem (#2) to solve
Dear VGTU@Home users,
We start solving the new problem. The problem size has been increased. First problem of our new dynamic visual cryptography application was essentially solved in one week. We have reached the speed of 625 GigaFLOPS. Using 4 nodes of our computer cluster http://vilkas.vgtu.lt/ganglia, the same problem would be solved in around 180 days.
At this point, we would like to thank our users for not abandoning the project and active participation, especially our top users, who currently make a major contribution to the project! Our current top contributor is Ralfy from the BOINC Synergy team, which also our current top team.
Our problem is a global optimization problem from the mathematical point of view. So, we will always have a user, who will be lucky to find the optimal solution. This time the lucky workunit was solved by Bazooka_CZ from the Czech National Team. Congratulations! :-)
We use this opportunity to wish all of you a Merry Christmas and a Happy New Year!
25 Dec 2015, 20:45:03 UTC
· Comment
... more
News is available as an RSS feed
|