The search functionality is under construction.
The search functionality is under construction.

Generalized Spot-Checking for Reliable Volunteer Computing

Kan WATANABE, Masaru FUKUSHI

  • Full Text Views

    0

  • Cite this

Summary :

While volunteer computing (VC) systems reach the most powerful computing platforms, they still have the problem of guaranteeing computational correctness, due to the inherent unreliability of volunteer participants. Spot-checking technique, which checks each participant by allocating spotter jobs, is a promising approach to the validation of computation results. The current spot-checking is based on the implicit assumption that participants never distinguish spotter jobs from normal ones; however generating such spotter jobs is still an open problem. Hence, in the real VC environment where the implicit assumption does not always hold, spot-checking-based methods such as well-known credibility-based voting become almost impossible to guarantee the computational correctness. In this paper, we generalize spot-checking by introducing the idea of imperfect checking. This generalization allows to guarantee the computational correctness under the situation that spot-checking is not fully-reliable and participants may distinguish spotter jobs. Moreover, we develop a generalized formula of the credibility, which enables credibility-based voting to utilize check-by-voting technique. Simulation results show that check-by-voting improves the performance of credibility-based voting, while guaranteeing the same level of computational correctness.

Publication
IEICE TRANSACTIONS on Information Vol.E93-D No.12 pp.3164-3172
Publication Date
2010/12/01
Publicized
Online ISSN
1745-1361
DOI
10.1587/transinf.E93.D.3164
Type of Manuscript
Special Section PAPER (Special Section on Parallel and Distributed Computing and Networking)
Category

Authors

Keyword