Scheduling scheme based on dedication rate in volunteer computing environment

EunJoung Byun, SungJin Choi, MaengSoon Baik, ChongSun Hwang, ChanYeol Park, Soon Young Jung

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

11 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 languageEnglish
Title of host publicationISPDC 2005: 4th International Symposium on Parallel and Distributed Computing
Pages234-241
Number of pages8
Volume2005
DOIs
Publication statusPublished - 2005 Dec 1
EventISPDC 2005: 4th International Symposium on Parallel and Distributed Computing - Lille, France
Duration: 2005 Jul 42005 Jul 6

Other

OtherISPDC 2005: 4th International Symposium on Parallel and Distributed Computing
CountryFrance
CityLille
Period05/7/405/7/6

Fingerprint

Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Byun, E., Choi, S., Baik, M., Hwang, C., Park, C., & 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 (Vol. 2005, pp. 234-241). [1609975] https://doi.org/10.1109/ISPDC.2005.42

Scheduling scheme based on dedication rate in volunteer computing environment. / Byun, EunJoung; Choi, SungJin; Baik, MaengSoon; Hwang, ChongSun; Park, ChanYeol; Jung, Soon Young.

ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing. Vol. 2005 2005. p. 234-241 1609975.

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

Byun, E, Choi, S, Baik, M, Hwang, C, Park, C & Jung, SY 2005, Scheduling scheme based on dedication rate in volunteer computing environment. in ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing. vol. 2005, 1609975, 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
Byun E, Choi S, Baik M, Hwang C, Park C, Jung SY. Scheduling scheme based on dedication rate in volunteer computing environment. In ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing. Vol. 2005. 2005. p. 234-241. 1609975 https://doi.org/10.1109/ISPDC.2005.42
Byun, EunJoung ; Choi, SungJin ; Baik, MaengSoon ; Hwang, ChongSun ; Park, ChanYeol ; Jung, Soon Young. / Scheduling scheme based on dedication rate in volunteer computing environment. ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing. Vol. 2005 2005. pp. 234-241
@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 = "EunJoung Byun and SungJin Choi and MaengSoon Baik and ChongSun Hwang and ChanYeol Park and Jung, {Soon Young}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISPDC.2005.42",
language = "English",
isbn = "0769524346",
volume = "2005",
pages = "234--241",
booktitle = "ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing",

}

TY - GEN

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

AU - Byun, EunJoung

AU - Choi, SungJin

AU - Baik, MaengSoon

AU - Hwang, ChongSun

AU - Park, ChanYeol

AU - Jung, Soon Young

PY - 2005/12/1

Y1 - 2005/12/1

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

SN - 0769524346

SN - 9780769524344

VL - 2005

SP - 234

EP - 241

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

ER -