11 Nov 2017 Enhanced statistics for the Siever app
On the Siever status page you see now on which base we are working and how they are progressing.
10 Nov 2017 Perfect Cuboid: Starting skipped range with more cuboids
In the Perfect Cuboid subproject we have added per user statistics of found cuboids, as well as subproject status page was extended by the common statistics. 11 November at 11:11 UTC we are going to launch the 0-10T range which we skipped from the beginning, which contains almost the same amount of cuboids we've already discovered, and throw out 4 times shorter tasks to give an opportunity for all concerned users to put into the personal statistics a large number of cuboids. So, don't miss the start time.
07 Nov 2017 P73 record number found with gmp-ecm
For the ECM repunit project user astroboylok found a 73 digit prime. This number will make it into the largest primes list ever found with gmp-ecm.
27 Oct 2017 Additional stats for Perfect Cuboid
We added per user statistics of found cuboids
and as well the subproject status page
was extended some common statistics.
Today we have added Hits to Perfect Cuboid subproject, so from now you can compete not only in earned Credits,
but also in the amount of found cuboids. Free-DC is already showing Hits in
And also good news, today we "crossed the equator" of the 1st Batch, Max In Progress threshold has exceeded
249 = 562.949.953.421.312, which is the half of our 1st goal - 250.
24 Oct 2017 A publication on Harmonious Trees and Odd Weird Search
It has been a long time, we know, that there was no news whatsoever the results of Harmonious Trees,
or Odd Weird Search. All we knew was that we found nothing, the conjectures remained safe, and even taking
on more credence. It sounds a bit anti-climatic.
But no! In this interval, we have been busy working on something. It is a research article, to be precise,
that describes what we did to make both projects possible, what we observed, and what we can do to make it better
(if there is a similar problem to be made into a volunteer computing project).
And finally, after a lot of writing and editing in between great periods of procrastination (yes, I did a PhD in math
in between, and yoyo of course needs to maintain the project alongside his work), today it is finally published!
Titled Parallel Tree Search in Volunteer Computing: a Case Study, the article can be found here:
It is open access, meaning that everyone can download it and have a look freely.
Thanks to TU Graz (I am a postdoc there), FWF (the Austria founding agency) and the library of TU Graz for having an
open access arrangement with Springer. Otherwise, the authors generally have to pay thousands of dollars for the open
access option. So, enjoy if you are interested!
Here is an abstract of the article:
While volunteer computing, as a restricted model of parallel computing, has proved itself to be a successful paradigm
of scientific computing with excellent benefit on cost efficiency and public outreach, many problems it solves are
intrinsically highly parallel. However, many efficient algorithms, including backtracking search, take the form of a
tree search on an extremely uneven tree that cannot be easily parallelized efficiently in the volunteer computing
paradigm. We explore in this article how to perform such searches efficiently on volunteer computing projects.
We propose a parallel tree search scheme, and we describe two examples of its real-world implementation, Harmonious Tree
and Odd Weird Search, both carried out at the volunteer computing project yoyo@home. To confirm the observed efficiency
of our scheme, we perform a mathematical analysis, which proves that, under reasonable assumption that agrees with
experimental observation, our scheme is only a constant multiplicative factor away from perfect parallelism. Details
on improving the overall performance are also discussed.
News is available as an
RSS feed .