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

Yuto Miyakoshi, Kan Watanabe, Masaru Fukushi, Yasuyuki Nogami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

This paper addresses the problem of job scheduling in volunteer computing (VC) systems where each computation job is replicated and distributed to multiple participants (workers) to remove incorrect results. In the job scheduling of VC, the number of assigned workers to complete a job is an important factor for the system performance, however, it cannot be fixed because some of the workers may not return results in real VC. We propose a job scheduling method which considers the expected probability of completion (EPC) for each job based on the worker's history information. The key idea of the proposed method is to assign jobs so that EPC is always greater than a specified value (SPC). By setting SPC as a reasonable value, any job in the proposed method can be completed without excess allocations, which leads to the higher performance of VC systems. Simulation results show that the performance of the proposed method is up to 5 times higher than that of the conventional method, while keeping the error rate lower than a required value.

Original languageEnglish
Title of host publicationProceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages399-405
Number of pages7
ISBN (Electronic)9781479941520
DOIs
Publication statusPublished - Feb 27 2015
Event2nd International Symposium on Computing and Networking, CANDAR 2014 - Shizuoka, Japan
Duration: Dec 10 2014Dec 12 2014

Publication series

NameProceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014

Other

Other2nd International Symposium on Computing and Networking, CANDAR 2014
CountryJapan
CityShizuoka
Period12/10/1412/12/14

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Miyakoshi, Y., Watanabe, K., Fukushi, M., & Nogami, Y. (2015). A job scheduling method based on expected probability of completion of voting in volunteer computing. In Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014 (pp. 399-405). [7052217] (Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CANDAR.2014.99