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
자원봉사 컴퓨팅(VC) 시스템은 가장 강력한 컴퓨팅 플랫폼에 도달했지만, 자원봉사자 참여자의 본질적인 비신뢰성으로 인해 여전히 계산 정확성을 보장하는 문제를 안고 있습니다. Spotter 작업을 할당하여 각 참가자를 확인하는 Spot-checking 기술은 계산 결과 검증에 대한 유망한 접근 방식입니다. 현재의 무작위 점검은 참가자가 일반 직무와 임시 직무를 구별하지 않는다는 암묵적인 가정에 기초하고 있습니다. 그러나 그러한 감시자 작업을 생성하는 것은 여전히 미해결 문제입니다. 따라서 암묵적인 가정이 항상 유지되지 않는 실제 VC 환경에서는 잘 알려진 신뢰성 기반 투표와 같은 무작위 확인 기반 방법은 계산의 정확성을 보장하는 것이 거의 불가능합니다. 본 논문에서는 불완전한 검사라는 개념을 도입하여 무작위 검사를 일반화합니다. 이러한 일반화를 통해 무작위 검사가 완전히 신뢰할 수 없고 참가자가 감시 작업을 구별할 수 있는 상황에서 계산 정확성을 보장할 수 있습니다. 또한, 검증별 투표 기법을 활용하여 신뢰도 기반 투표를 가능하게 하는 일반화된 신뢰도 공식을 개발합니다. 시뮬레이션 결과는 투표에 의한 확인이 신뢰성 기반 투표의 성능을 향상시키는 동시에 동일한 수준의 계산 정확성을 보장한다는 것을 보여줍니다.
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.
부
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
부
@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},}
부
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 -