Expected-Credibility-Based Job Scheduling for Reliable Volunteer Computing

Watanabe, Kouichi; Fukushi, Masaru; Horiguchi, Susumu

doi:10.1587/transinf.e93.d.306

Cited by 14 publications

(20 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, traditional detection techniques such as "heart-beat" are not available to detect the worker's secession in VC because communications between the pair of master and worker are initiated on the request of the worker. The worker's secession does not have significant impacts on the error rate in credibility-based voting [23]. However, it affects the efficiency of job scheduling and the number of completed jobs.…”

Section: The Effect Of Worker's Secessionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

Miyakoshi

Yasuda

Watanabe

et al. 2015

IEICE Trans. Inf. & Syst.

Self Cite

View full text Add to dashboard Cite

SUMMARYThis paper addresses the problem of job scheduling in volunteer computing (VC) systems where each computation job is replicated and allocated to multiple participants (workers) to remove incorrect results by a voting mechanism. In the job scheduling of VC, the number of workers to complete a job is an important factor for the system performance; however, it cannot be fixed because some of the workers may secede in real VC. This is the problem that existing methods have not considered in the job scheduling. We propose a dynamic job scheduling method which considers the expected probability of completion (EPC) for each job based on the probability of worker's secession. The key idea of the proposed method is to allocate jobs so that EPC is always greater than a specified value (SPC). By setting SPC as a reasonable value, the proposed method enables to complete jobs without excess allocation, which leads to the higher performance of VC systems. We assume in this paper that worker's secession probability follows Weibull-distribution which is known to reflect more practical situation. We derive parameters for the distribution using actual trace data and compare the performance of the proposed and the previous method under the Weibull-distribution model, as well as the previous constant probability model. Simulation results show that the performance of the proposed method is up to 5 times higher than that of the existing method especially when the time for completing jobs is restricted, while keeping the error rate lower than a required value.

show abstract

Section: The Effect Of Worker's Secessionmentioning

confidence: 99%

“…The credibility of a worker is calculated based on the number of times being majority in past voting. As a feature of the credibility-based voting, the required number of candidate results to complete a job becomes smaller with time because the credibility of reliable workers increases naturally with time [18].…”

Section: Introductionmentioning

confidence: 99%

Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

Miyakoshi

Yasuda

Watanabe

et al. 2015

IEICE Trans. Inf. & Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…4.2.2, we evaluate the performance of credibility-based voting with check-byvoting in terms of error rates and computation times T . Because computation time is highly dependent on job scheduling algorithm, we employ three job scheduling algorithms: the round-robin, the random and the ENR + ECJ [8] methods. The ENR+ECJ method [8] is known as an efficient job scheduling method for credibility-based voting.…”

Section: Simulation Conditionsmentioning

confidence: 99%

“…Because computation time is highly dependent on job scheduling algorithm, we employ three job scheduling algorithms: the round-robin, the random and the ENR + ECJ [8] methods. The ENR+ECJ method [8] is known as an efficient job scheduling method for credibility-based voting. Error rates and computation times T are evaluated as the average of 1000 simulation results.…”

Section: Simulation Conditionsmentioning

confidence: 99%

Generalized Spot-Checking for Reliable Volunteer Computing

Watanabe

Fukushi

2010

IEICE Trans. Inf. & Syst.

Self Cite

View full text Add to dashboard Cite

SUMMARYWhile 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-byvoting improves the performance of credibility-based voting, while guaranteeing the same level of computational correctness.

show abstract

“…The key idea for the estimation is to represent the mathematical expectation of the computation time as a function of spot-check rate. In the derivation of the computation time, an efficient job selection strategy called Expected Number of Results (EN R) based method [20] is employed. The main contribution of our work are the following.…”

Section: Introductionmentioning

confidence: 99%

Optimal Spot-checking for Computation Time Minimization in Volunteer Computing

2009

Self Cite

View full text Add to dashboard Cite

This paper proposes an optimization technique for spot-checking to minimize the computation time in volunteer computing (VC) systems with non-reliable participants. Credibility-based voting with spot-checking is a promising approach to the high-performance and reliable VC systems. In this approach, spot-check rate has a significant impact on the performance, which must be set before the computation. Therefore, the estimation of the optimal spotcheck rate is the major concern to minimize the computation time. The key idea for the estimation is to represent the mathematical expectation of the computation time as a function of spotcheck rate. Extensive simulation has shown that the proposed technique always obtains an approximate estimate of the optimal spot-check rate and minimizes the computation time with an uncertainty of 1%.

show abstract

Expected-Credibility-Based Job Scheduling for Reliable Volunteer Computing

Cited by 14 publications

References 13 publications

Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

Generalized Spot-Checking for Reliable Volunteer Computing

Optimal Spot-checking for Computation Time Minimization in Volunteer Computing

Contact Info

Product

Resources

About