Dynamic job scheduling method based on expected probability of completion of voting in volunteer computing

Yuto Miyakoshi, Shinya Yasuda, Kan Watanabe, Masaru Fukushi, Yasuyuki Nogami

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This 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 votingmechanism. 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.

Original languageEnglish
Pages (from-to)2132-2140
Number of pages9
JournalIEICE Transactions on Information and Systems
VolumeE98D
Issue number12
DOIs
Publication statusPublished - Dec 1 2015

Fingerprint

Scheduling
Weibull distribution

Keywords

  • Desktop grids
  • Parallel computing
  • Probabilistic method
  • Sabotage-tolerance

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

Dynamic job scheduling method based on expected probability of completion of voting in volunteer computing. / Miyakoshi, Yuto; Yasuda, Shinya; Watanabe, Kan; Fukushi, Masaru; Nogami, Yasuyuki.

In: IEICE Transactions on Information and Systems, Vol. E98D, No. 12, 01.12.2015, p. 2132-2140.

Research output: Contribution to journalArticle

Miyakoshi, Yuto ; Yasuda, Shinya ; Watanabe, Kan ; Fukushi, Masaru ; Nogami, Yasuyuki. / Dynamic job scheduling method based on expected probability of completion of voting in volunteer computing. In: IEICE Transactions on Information and Systems. 2015 ; Vol. E98D, No. 12. pp. 2132-2140.
@article{b1817044913e45ca866dfb61df97f8e5,
title = "Dynamic job scheduling method based on expected probability of completion of voting in volunteer computing",
abstract = "This 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 votingmechanism. 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.",
keywords = "Desktop grids, Parallel computing, Probabilistic method, Sabotage-tolerance",
author = "Yuto Miyakoshi and Shinya Yasuda and Kan Watanabe and Masaru Fukushi and Yasuyuki Nogami",
year = "2015",
month = "12",
day = "1",
doi = "10.1587/transinf.2015PAP0027",
language = "English",
volume = "E98D",
pages = "2132--2140",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Dynamic job scheduling method based on expected probability of completion of voting in volunteer computing

AU - Miyakoshi, Yuto

AU - Yasuda, Shinya

AU - Watanabe, Kan

AU - Fukushi, Masaru

AU - Nogami, Yasuyuki

PY - 2015/12/1

Y1 - 2015/12/1

N2 - This 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 votingmechanism. 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.

AB - This 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 votingmechanism. 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.

KW - Desktop grids

KW - Parallel computing

KW - Probabilistic method

KW - Sabotage-tolerance

UR - http://www.scopus.com/inward/record.url?scp=84948747673&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948747673&partnerID=8YFLogxK

U2 - 10.1587/transinf.2015PAP0027

DO - 10.1587/transinf.2015PAP0027

M3 - Article

VL - E98D

SP - 2132

EP - 2140

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 12

ER -