The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Walaupun sistem pengkomputeran sukarela (VC) mencapai platform pengkomputeran yang paling berkuasa, mereka masih menghadapi masalah untuk menjamin ketepatan pengiraan, disebabkan oleh ketidakpercayaan yang wujud pada peserta sukarelawan. Teknik semakan tempat, yang menyemak setiap peserta dengan memperuntukkan kerja pengesan, adalah pendekatan yang menjanjikan untuk pengesahan hasil pengiraan. Pemeriksaan mengejut semasa adalah berdasarkan andaian tersirat bahawa peserta tidak pernah membezakan pekerjaan pengesan daripada pekerjaan biasa; namun menjana pekerjaan pengesan seperti itu masih menjadi masalah terbuka. Oleh itu, dalam persekitaran VC sebenar di mana andaian tersirat tidak selalu berlaku, kaedah berasaskan semakan spot seperti pengundian berasaskan kredibiliti yang terkenal menjadi hampir mustahil untuk menjamin ketepatan pengiraan. Dalam kertas ini, kami menyamaratakan semakan mengejut dengan memperkenalkan idea semakan tidak sempurna. Generalisasi ini membolehkan untuk menjamin ketepatan pengiraan di bawah keadaan semakan spot tidak boleh dipercayai sepenuhnya dan peserta boleh membezakan pekerjaan spotter. Selain itu, kami membangunkan formula umum kredibiliti, yang membolehkan pengundian berasaskan kredibiliti menggunakan teknik semak demi undian. Keputusan simulasi menunjukkan bahawa undian semak demi undi meningkatkan prestasi undian berasaskan kredibiliti, sambil menjamin tahap ketepatan pengiraan yang sama.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Kan WATANABE, Masaru FUKUSHI, "Generalized Spot-Checking for Reliable Volunteer Computing" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 12, pp. 3164-3172, December 2010, doi: 10.1587/transinf.E93.D.3164.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.3164/_p
Salinan
@ARTICLE{e93-d_12_3164,
author={Kan WATANABE, Masaru FUKUSHI, },
journal={IEICE TRANSACTIONS on Information},
title={Generalized Spot-Checking for Reliable Volunteer Computing},
year={2010},
volume={E93-D},
number={12},
pages={3164-3172},
abstract={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.},
keywords={},
doi={10.1587/transinf.E93.D.3164},
ISSN={1745-1361},
month={December},}
Salinan
TY - JOUR
TI - Generalized Spot-Checking for Reliable Volunteer Computing
T2 - IEICE TRANSACTIONS on Information
SP - 3164
EP - 3172
AU - Kan WATANABE
AU - Masaru FUKUSHI
PY - 2010
DO - 10.1587/transinf.E93.D.3164
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2010
AB - 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.
ER -