Scheduling scheme based on dedication rate in volunteer computing environment

Eun Joung Byun; Sung Jin Choi; Maeng Soon Baik; Chong Sun Hwang; Chan Yeol Park; Soon Young Jung

doi:10.1109/ISPDC.2005.42

Scheduling scheme based on dedication rate in volunteer computing environment

Eun Joung Byun, Sung Jin Choi, Maeng Soon Baik, Chong Sun Hwang, Chan Yeol Park, Soon Young Jung

Department of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

12 Citations (Scopus)

Abstract

A volunteer node can join and leave a volunteer computing system freely. However, existing volunteer computing systems suffer from interruptions of job execution, delays of execution time, and increases of total execution time, since they do not consider dynamic scheduling properties (i.e. volatilities), such as leave, join, and suspension. Therefore, dynamic execution properties of volunteer node should be considered in scheduling schemes, in order to design a stable and reliable volunteer computing system. This paper proposes a new scheduling scheme based on the Dedication Rate (DR), which reflects the dynamic properties of a volunteer. The scheduling scheme improves the completeness and reliability of execution, while also decreasing delay and total execution time. In addition, an implementation of the proposed scheduling scheme on top of Korea@Home is described, as well as performance evaluation.

Original language	English
Title of host publication	ISPDC 2005
Subtitle of host publication	4th International Symposium on Parallel and Distributed Computing
Pages	234-241
Number of pages	8
DOIs	https://doi.org/10.1109/ISPDC.2005.42
Publication status	Published - 2005
Event	ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing - Lille, France Duration: 2005 Jul 4 → 2005 Jul 6

Publication series

Name	ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing
Volume	2005

Other

Other	ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing
Country/Territory	France
City	Lille
Period	05/7/4 → 05/7/6

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/ISPDC.2005.42

Cite this

Byun, E. J., Choi, S. J., Baik, M. S., Hwang, C. S., Park, C. Y., & Jung, S. Y. (2005). Scheduling scheme based on dedication rate in volunteer computing environment. In ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing (pp. 234-241). Article 1609975 (ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing; Vol. 2005). https://doi.org/10.1109/ISPDC.2005.42

Scheduling scheme based on dedication rate in volunteer computing environment. / Byun, Eun Joung; Choi, Sung Jin; Baik, Maeng Soon et al.
ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing. 2005. p. 234-241 1609975 (ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Byun, EJ, Choi, SJ, Baik, MS, Hwang, CS, Park, CY & Jung, SY 2005, Scheduling scheme based on dedication rate in volunteer computing environment. in ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing., 1609975, ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing, vol. 2005, pp. 234-241, ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing, Lille, France, 05/7/4. https://doi.org/10.1109/ISPDC.2005.42

@inproceedings{6882578bcfb54e73a77e8f5b1e17fc7a,

title = "Scheduling scheme based on dedication rate in volunteer computing environment",

abstract = "A volunteer node can join and leave a volunteer computing system freely. However, existing volunteer computing systems suffer from interruptions of job execution, delays of execution time, and increases of total execution time, since they do not consider dynamic scheduling properties (i.e. volatilities), such as leave, join, and suspension. Therefore, dynamic execution properties of volunteer node should be considered in scheduling schemes, in order to design a stable and reliable volunteer computing system. This paper proposes a new scheduling scheme based on the Dedication Rate (DR), which reflects the dynamic properties of a volunteer. The scheduling scheme improves the completeness and reliability of execution, while also decreasing delay and total execution time. In addition, an implementation of the proposed scheduling scheme on top of Korea@Home is described, as well as performance evaluation.",

author = "Byun, {Eun Joung} and Choi, {Sung Jin} and Baik, {Maeng Soon} and Hwang, {Chong Sun} and Park, {Chan Yeol} and Jung, {Soon Young}",

year = "2005",

doi = "10.1109/ISPDC.2005.42",

language = "English",

isbn = "0769524346",

series = "ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing",

pages = "234--241",

booktitle = "ISPDC 2005",

note = "ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing ; Conference date: 04-07-2005 Through 06-07-2005",

}

TY - GEN

T1 - Scheduling scheme based on dedication rate in volunteer computing environment

AU - Byun, Eun Joung

AU - Choi, Sung Jin

AU - Baik, Maeng Soon

AU - Hwang, Chong Sun

AU - Park, Chan Yeol

AU - Jung, Soon Young

PY - 2005

Y1 - 2005

N2 - A volunteer node can join and leave a volunteer computing system freely. However, existing volunteer computing systems suffer from interruptions of job execution, delays of execution time, and increases of total execution time, since they do not consider dynamic scheduling properties (i.e. volatilities), such as leave, join, and suspension. Therefore, dynamic execution properties of volunteer node should be considered in scheduling schemes, in order to design a stable and reliable volunteer computing system. This paper proposes a new scheduling scheme based on the Dedication Rate (DR), which reflects the dynamic properties of a volunteer. The scheduling scheme improves the completeness and reliability of execution, while also decreasing delay and total execution time. In addition, an implementation of the proposed scheduling scheme on top of Korea@Home is described, as well as performance evaluation.

AB - A volunteer node can join and leave a volunteer computing system freely. However, existing volunteer computing systems suffer from interruptions of job execution, delays of execution time, and increases of total execution time, since they do not consider dynamic scheduling properties (i.e. volatilities), such as leave, join, and suspension. Therefore, dynamic execution properties of volunteer node should be considered in scheduling schemes, in order to design a stable and reliable volunteer computing system. This paper proposes a new scheduling scheme based on the Dedication Rate (DR), which reflects the dynamic properties of a volunteer. The scheduling scheme improves the completeness and reliability of execution, while also decreasing delay and total execution time. In addition, an implementation of the proposed scheduling scheme on top of Korea@Home is described, as well as performance evaluation.

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

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

U2 - 10.1109/ISPDC.2005.42

DO - 10.1109/ISPDC.2005.42

M3 - Conference contribution

AN - SCOPUS:33847732697

SN - 0769524346

SN - 9780769524344

T3 - ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing

SP - 234

EP - 241

BT - ISPDC 2005

T2 - ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing

Y2 - 4 July 2005 through 6 July 2005

ER -

Scheduling scheme based on dedication rate in volunteer computing environment

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this