"We also thank the volunteers in yoyo@home that contributed to Harmonious Trees and Odd Weird Search."
- from the article "Parallel Tree Search in Volunteer Computing: a Case Study" (authors: Wenjie Fang from Technical University of Graz, Austria and Uwe Beckert from yoyo@home) in Journal of Grid Computing (October 2017)
- the complete PDF can be downloaded here
"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 realworld implementation, Harmonious Tree and Odd Weird Search, both carried out at the volunteer computing project yoyo@home."
The leading BOINC teams which do the work at yoyo@home are:
yoyo@home is 1 of the 25 BOINC projects where Gridcoin users can get rewards for