GA-based job scheduling strategies for fault tolerant grid systems

Chao Chin Wu, Kuan Chou Lai, Ren Yi Sun

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

12 Citations (Scopus)

Abstract

This work mainly aims at the designs of the genetic algorithm based scheduling strategies by considering four different fault tolerance techniques in the Grid environment, including Retry, Migration, Checkpoint, Replication. We also take into account the risk relationship between jobs and nodes to improve the system reliability in the scheduling algorithm. According to the simulation results, we can find out that the performance of fault tolerant algorithms is better than risky algorithm whether in makespan, average turnaround time, or the job failure rate. Checkpoint algorithm has the best performance in all algorithms. On the other hand, retry algorithm is recommended for the system where the job sizes are usually smaller because of its simplicity. Finally, replicated algorithm is not suitable for the Grid since it imposes too much overhead.

Original languageEnglish
Title of host publicationProceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008
PublisherIEEE Computer Society
Pages27-32
Number of pages6
ISBN (Print)9780769534732
DOIs
Publication statusPublished - 2008 Jan 1
Event3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008 - Yilan, Taiwan
Duration: 2008 Dec 92008 Dec 12

Publication series

NameProceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008

Other

Other3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008
CountryTaiwan
CityYilan
Period08-12-0908-12-12

Fingerprint

Scheduling
Turnaround time
Fault tolerance
Scheduling algorithms
Genetic algorithms

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software
  • Electrical and Electronic Engineering

Cite this

Wu, C. C., Lai, K. C., & Sun, R. Y. (2008). GA-based job scheduling strategies for fault tolerant grid systems. In Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008 (pp. 27-32). [4780647] (Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008). IEEE Computer Society. https://doi.org/10.1109/APSCC.2008.165
Wu, Chao Chin ; Lai, Kuan Chou ; Sun, Ren Yi. / GA-based job scheduling strategies for fault tolerant grid systems. Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008. IEEE Computer Society, 2008. pp. 27-32 (Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008).
@inproceedings{eaa503d8ae754cc087649de651b31462,
title = "GA-based job scheduling strategies for fault tolerant grid systems",
abstract = "This work mainly aims at the designs of the genetic algorithm based scheduling strategies by considering four different fault tolerance techniques in the Grid environment, including Retry, Migration, Checkpoint, Replication. We also take into account the risk relationship between jobs and nodes to improve the system reliability in the scheduling algorithm. According to the simulation results, we can find out that the performance of fault tolerant algorithms is better than risky algorithm whether in makespan, average turnaround time, or the job failure rate. Checkpoint algorithm has the best performance in all algorithms. On the other hand, retry algorithm is recommended for the system where the job sizes are usually smaller because of its simplicity. Finally, replicated algorithm is not suitable for the Grid since it imposes too much overhead.",
author = "Wu, {Chao Chin} and Lai, {Kuan Chou} and Sun, {Ren Yi}",
year = "2008",
month = "1",
day = "1",
doi = "10.1109/APSCC.2008.165",
language = "English",
isbn = "9780769534732",
series = "Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008",
publisher = "IEEE Computer Society",
pages = "27--32",
booktitle = "Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008",
address = "United States",

}

Wu, CC, Lai, KC & Sun, RY 2008, GA-based job scheduling strategies for fault tolerant grid systems. in Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008., 4780647, Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008, IEEE Computer Society, pp. 27-32, 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008, Yilan, Taiwan, 08-12-09. https://doi.org/10.1109/APSCC.2008.165

GA-based job scheduling strategies for fault tolerant grid systems. / Wu, Chao Chin; Lai, Kuan Chou; Sun, Ren Yi.

Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008. IEEE Computer Society, 2008. p. 27-32 4780647 (Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008).

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

TY - GEN

T1 - GA-based job scheduling strategies for fault tolerant grid systems

AU - Wu, Chao Chin

AU - Lai, Kuan Chou

AU - Sun, Ren Yi

PY - 2008/1/1

Y1 - 2008/1/1

N2 - This work mainly aims at the designs of the genetic algorithm based scheduling strategies by considering four different fault tolerance techniques in the Grid environment, including Retry, Migration, Checkpoint, Replication. We also take into account the risk relationship between jobs and nodes to improve the system reliability in the scheduling algorithm. According to the simulation results, we can find out that the performance of fault tolerant algorithms is better than risky algorithm whether in makespan, average turnaround time, or the job failure rate. Checkpoint algorithm has the best performance in all algorithms. On the other hand, retry algorithm is recommended for the system where the job sizes are usually smaller because of its simplicity. Finally, replicated algorithm is not suitable for the Grid since it imposes too much overhead.

AB - This work mainly aims at the designs of the genetic algorithm based scheduling strategies by considering four different fault tolerance techniques in the Grid environment, including Retry, Migration, Checkpoint, Replication. We also take into account the risk relationship between jobs and nodes to improve the system reliability in the scheduling algorithm. According to the simulation results, we can find out that the performance of fault tolerant algorithms is better than risky algorithm whether in makespan, average turnaround time, or the job failure rate. Checkpoint algorithm has the best performance in all algorithms. On the other hand, retry algorithm is recommended for the system where the job sizes are usually smaller because of its simplicity. Finally, replicated algorithm is not suitable for the Grid since it imposes too much overhead.

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

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

U2 - 10.1109/APSCC.2008.165

DO - 10.1109/APSCC.2008.165

M3 - Conference contribution

AN - SCOPUS:67049167695

SN - 9780769534732

T3 - Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008

SP - 27

EP - 32

BT - Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008

PB - IEEE Computer Society

ER -

Wu CC, Lai KC, Sun RY. GA-based job scheduling strategies for fault tolerant grid systems. In Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008. IEEE Computer Society. 2008. p. 27-32. 4780647. (Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008). https://doi.org/10.1109/APSCC.2008.165