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

Miyakoshi, Yuto; Watanabe, Kouichi; Fukushi, Masaru; Nogami, Yasuyuki

doi:10.1109/candar.2014.99

Cited by 7 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast to the static task assignment algorithms, the dynamic task assignment algorithms have the task execution order and the task assignment plan determined dynamically according to the application's execution [38][39][40]. To execute parallel programs more efficiently in VCPs, many scholars have proposed many dynamic task assignment algorithms [16,18,41] in recent decades.…”

Section: Dynamic Task Assignment Algorithmsmentioning

confidence: 99%

“…Guler et al [16] proposed a dynamic task assignment algorithm under the constraints of the power price, and their goal was also to maximize the number of task completions. In the paper [18], the authors proposed a dynamic algorithm which used the estimation of the spot-check rate to minimize the makespan. These works are different from ours, as our goal is to maximize the benefit of the VCPs.…”

Section: Dynamic Task Assignment Algorithmsmentioning

confidence: 99%

“…From the perspective of VCPs, having the goal of a maximum benefit problem leads to an interesting task assignment problem under the assumption that computing services from VCPs can obtain financial benefits. How to assign tasks to appropriate workers has been extensively studied in prior works [10][11][12][13][14][15][16][17][18]. In these prior works, some studies are static task scheduling algorithms and others are dynamic task scheduling algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Research on the Task Assignment Problem with Maximum Benefits in Volunteer Computing Platforms

Qiao

Lin

et al. 2020

Symmetry

View full text Add to dashboard Cite

As a type of distributed computing, volunteer computing (VC) has provided unlimited computing capacity at a low cost in recent decades. The architecture of most volunteer computing platforms (VCPs) is a master–worker model, which defines a master–slave relationship. Therefore, VCPs can be considered asymmetric multiprocessing systems (AMSs). As AMSs, VCPs are very promising for providing computing services for users. Users can submit tasks with deadline constraints to the VCPs. If the tasks are completed within their deadlines, VCPs will obtain the benefits. For this application scenario, this paper proposes a new task assignment problem with the maximum benefits in VCPs for the first time. To address the problem, we first proposed a list-based task assignment (LTA) strategy, and we proved that the LTA strategy could complete the task with a deadline constraint as soon as possible. Then, based on the LTA strategy, we proposed a maximum benefit scheduling (MBS) algorithm, which aimed at maximizing the benefits of VCPs. The MBS algorithm determined the acceptable tasks using a pruning strategy. Finally, the experiment results show that our proposed algorithm is more effective than current algorithms in the aspects of benefits, task acceptance rate and task completion rate.

show abstract

Section: Dynamic Task Assignment Algorithmsmentioning

confidence: 99%

Section: Dynamic Task Assignment Algorithmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Research on the Task Assignment Problem with Maximum Benefits in Volunteer Computing Platforms

Qiao

Lin

et al. 2020

Symmetry

View full text Add to dashboard Cite

show abstract

“…. W as in [24] and the Weibulldistribution model, in which reaP down i changes with time based on Eq. (9) for i = 1, .…”

Section: Simulation Conditionsmentioning

confidence: 99%

“…Thus, in this paper, we model worker's secession following the Weibulldistribution. We derive parameters for the distribution using actual trace data [20] and compare the performance of the proposed and the previous method under the Weibulldistribution model, as well as the previous constant probability model [24].…”

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

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

Replication of “Tail” Computations in a Desktop Grid Project

Ivashko

Nikitina

2020

Communications in Computer and Information Science

View full text Add to dashboard Cite

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

Cited by 7 publications

References 6 publications

Research on the Task Assignment Problem with Maximum Benefits in Volunteer Computing Platforms

Research on the Task Assignment Problem with Maximum Benefits in Volunteer Computing Platforms

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

Replication of “Tail” Computations in a Desktop Grid Project

Contact Info

Product

Resources

About