Parallel Tree Search in Volunteer Computing: a Case Study

Wenjie Fang, Uwe Beckert

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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.
Original languageEnglish
JournalJournal of Grid Computing
DOIs
Publication statusE-pub ahead of print - 23 Oct 2017

Fingerprint

Natural sciences computing
Parallel processing systems
Costs

Keywords

  • volunteer computing
  • parallel tree search
  • power law
  • performance
  • implementation

Cite this

Parallel Tree Search in Volunteer Computing: a Case Study. / Fang, Wenjie; Beckert, Uwe.

In: Journal of Grid Computing, 23.10.2017.

Research output: Contribution to journalArticleResearchpeer-review

@article{b310aadd1ebb4f8cbbe7b754ef9e0e6b,
title = "Parallel Tree Search in Volunteer Computing: a Case Study",
abstract = "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.",
keywords = "volunteer computing, parallel tree search, power law, performance, implementation",
author = "Wenjie Fang and Uwe Beckert",
year = "2017",
month = "10",
day = "23",
doi = "10.1007/s10723-017-9411-5",
language = "English",
journal = "Journal of Grid Computing",
issn = "1570-7873",
publisher = "Springer Science+Business Media B.V",

}

TY - JOUR

T1 - Parallel Tree Search in Volunteer Computing: a Case Study

AU - Fang, Wenjie

AU - Beckert, Uwe

PY - 2017/10/23

Y1 - 2017/10/23

N2 - 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.

AB - 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.

KW - volunteer computing

KW - parallel tree search

KW - power law

KW - performance

KW - implementation

U2 - 10.1007/s10723-017-9411-5

DO - 10.1007/s10723-017-9411-5

M3 - Article

JO - Journal of Grid Computing

JF - Journal of Grid Computing

SN - 1570-7873

ER -