TY - JOUR
T1 - Adaptive group-based job scheduling for high performance and reliable volunteer computing
AU - Watanabe, Kan
AU - Fukushi, Masaru
AU - Kameyama, Michitaka
N1 - Publisher Copyright:
© 2011 Information Processing Society of Japan.
PY - 2011
Y1 - 2011
N2 - This paper presents an adaptive group-based job scheduling method for credibility-based sabotage-tolerance techniques in volunteer computing (VC) systems. Credibility-based technique is a promising approach for reliable VC systems since it guarantees computational correctness mathematically based on the credibility of participants. Check-by-voting reduces the cost of checking credibility in credibility-based technique. However, in some applications where the deadline of the computation is relatively short, current job scheduling methods do not work well for check-by-voting and significantly degrade performance. To improve the performance of VCs, the proposed job scheduling method adaptively groups participants based on the expected-credibility to take into account the participants under job execution. Simulation of VCs shows that the proposed method always outperforms current job scheduling methods regardless of the values of unknown parameters such as population and behavior of saboteurs.
AB - This paper presents an adaptive group-based job scheduling method for credibility-based sabotage-tolerance techniques in volunteer computing (VC) systems. Credibility-based technique is a promising approach for reliable VC systems since it guarantees computational correctness mathematically based on the credibility of participants. Check-by-voting reduces the cost of checking credibility in credibility-based technique. However, in some applications where the deadline of the computation is relatively short, current job scheduling methods do not work well for check-by-voting and significantly degrade performance. To improve the performance of VCs, the proposed job scheduling method adaptively groups participants based on the expected-credibility to take into account the participants under job execution. Simulation of VCs shows that the proposed method always outperforms current job scheduling methods regardless of the values of unknown parameters such as population and behavior of saboteurs.
UR - http://www.scopus.com/inward/record.url?scp=84867455374&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867455374&partnerID=8YFLogxK
U2 - 10.2197/ipsjjip.19.39
DO - 10.2197/ipsjjip.19.39
M3 - Article
AN - SCOPUS:84867455374
SN - 0387-5806
VL - 19
SP - 39
EP - 51
JO - Journal of Information Processing
JF - Journal of Information Processing
ER -