IEICE TRANSACTIONS on Information
Expected-Credibility-Based Job Scheduling for Reliable Volunteer Computing
Summary :
This paper presents a proposal of an expected-credibility-based job scheduling method for volunteer computing (VC) systems with malicious participants who return erroneous results. Credibility-based voting is a promising approach to guaranteeing the computational correctness of VC systems. However, it relies on a simple round-robin job scheduling method that does not consider the jobs' order of execution, thereby resulting in numerous unnecessary job allocations and performance degradation of VC systems. To improve the performance of VC systems, the proposed job scheduling method selects a job to be executed prior to others dynamically based on two novel metrics: expected credibility and the expected number of results for each job. Simulation of VCs shows that the proposed method can improve the VC system performance up to 11%; It always outperforms the original round-robin method irrespective of the value of unknown parameters such as population and behavior of saboteurs.
- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.2 pp.306-314
- Publication Date
- 2010/02/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E93.D.306
- Type of Manuscript
- PAPER
- Category
- Computer Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Kan WATANABE, Masaru FUKUSHI, Susumu HORIGUCHI, "Expected-Credibility-Based Job Scheduling for Reliable Volunteer Computing" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 2, pp. 306-314, February 2010, doi: 10.1587/transinf.E93.D.306.
Abstract: This paper presents a proposal of an expected-credibility-based job scheduling method for volunteer computing (VC) systems with malicious participants who return erroneous results. Credibility-based voting is a promising approach to guaranteeing the computational correctness of VC systems. However, it relies on a simple round-robin job scheduling method that does not consider the jobs' order of execution, thereby resulting in numerous unnecessary job allocations and performance degradation of VC systems. To improve the performance of VC systems, the proposed job scheduling method selects a job to be executed prior to others dynamically based on two novel metrics: expected credibility and the expected number of results for each job. Simulation of VCs shows that the proposed method can improve the VC system performance up to 11%; It always outperforms the original round-robin method irrespective of the value of unknown parameters such as population and behavior of saboteurs.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.306/_p
Copy
@ARTICLE{e93-d_2_306,
author={Kan WATANABE, Masaru FUKUSHI, Susumu HORIGUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={Expected-Credibility-Based Job Scheduling for Reliable Volunteer Computing},
year={2010},
volume={E93-D},
number={2},
pages={306-314},
abstract={This paper presents a proposal of an expected-credibility-based job scheduling method for volunteer computing (VC) systems with malicious participants who return erroneous results. Credibility-based voting is a promising approach to guaranteeing the computational correctness of VC systems. However, it relies on a simple round-robin job scheduling method that does not consider the jobs' order of execution, thereby resulting in numerous unnecessary job allocations and performance degradation of VC systems. To improve the performance of VC systems, the proposed job scheduling method selects a job to be executed prior to others dynamically based on two novel metrics: expected credibility and the expected number of results for each job. Simulation of VCs shows that the proposed method can improve the VC system performance up to 11%; It always outperforms the original round-robin method irrespective of the value of unknown parameters such as population and behavior of saboteurs.},
keywords={},
doi={10.1587/transinf.E93.D.306},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Expected-Credibility-Based Job Scheduling for Reliable Volunteer Computing
T2 - IEICE TRANSACTIONS on Information
SP - 306
EP - 314
AU - Kan WATANABE
AU - Masaru FUKUSHI
AU - Susumu HORIGUCHI
PY - 2010
DO - 10.1587/transinf.E93.D.306
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2010
AB - This paper presents a proposal of an expected-credibility-based job scheduling method for volunteer computing (VC) systems with malicious participants who return erroneous results. Credibility-based voting is a promising approach to guaranteeing the computational correctness of VC systems. However, it relies on a simple round-robin job scheduling method that does not consider the jobs' order of execution, thereby resulting in numerous unnecessary job allocations and performance degradation of VC systems. To improve the performance of VC systems, the proposed job scheduling method selects a job to be executed prior to others dynamically based on two novel metrics: expected credibility and the expected number of results for each job. Simulation of VCs shows that the proposed method can improve the VC system performance up to 11%; It always outperforms the original round-robin method irrespective of the value of unknown parameters such as population and behavior of saboteurs.
ER -
English
