DocumentCode
3250356
Title
Checkpointing in selected most fitted resource task scheduling in grid computing
Author
Latip, Rohaya ; San, Lew Wai ; Chanchary, Fara Habib
Author_Institution
Coll. of Comput. Sci. & Inf. Syst., Najran Univ., Najran, Saudi Arabia
fYear
2012
fDate
14-17 July 2012
Firstpage
331
Lastpage
334
Abstract
Grid applications run on environment that is prone to different kinds of failures. Fault tolerance is the ability to ensure successful delivery of services despite faults that may occur. Our research adds fault tolerance capacity with checkpointing and machine failure, to the current research, Selected Most Fitted (SMF) Task Scheduling for grid computing. This paper simulates one of fault tolerance techniques for grid computing, which is implementing checkpointing into Select Most Fitting Resource for Task Scheduling algorithm (SMF). We applied the algorithm of MeanFailure with Checkpointing in the SMF algorithm and named it MeanFailureCP-SMF. The MeanFailureCP-SMF is simulated using Gridsim with initial checkpointing interval at 20% job execution time. Results show that with MeanFailureCP-SMF has reduce the average execution time (AET) compare to the current SMF and MeanFailure Algorithm.
Keywords
checkpointing; grid computing; scheduling; software fault tolerance; Gridsim; MeanFailureCP-SMF; checkpointing; fault tolerance capacity; grid computing; machine failure; selected most fitted resource task scheduling algorithm; Checkpointing; Computer science; Educational institutions; Grid computing; Heuristic algorithms; Processor scheduling; Scheduling; Checkpointing; Fault Tolerance; Grid Computing; GridSim; Job Scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science & Education (ICCSE), 2012 7th International Conference on
Conference_Location
Melbourne, VIC
Print_ISBN
978-1-4673-0241-8
Type
conf
DOI
10.1109/ICCSE.2012.6295085
Filename
6295085
Link To Document