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

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 importan...

Full description

Saved in:
Bibliographic Details
Main Authors: Miyakoshi, Yuto, Watanabe, Kan, Fukushi, Masaru, Nogami, Yasuyuki
Format: Conference Proceeding
Language:English
Subjects:
Computational modeling
Desktop Grids
Educational institutions
Electronic mail
Error analysis
Parallel Computing
Probabilistic Method
Processor scheduling
Reliability
Resource management
Sabotage-Tolerance
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2379-1888
2379-1896
DOI:10.1109/CANDAR.2014.99