Parallel Tree Search in Volunteer Computing: a Case Study

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.