Checkpointing in selected most fitted resource task scheduling in grid computing

Citation

Latip, Rohaya and Lew, Wai San and Chanchary, Fara Habib (2012) Checkpointing in selected most fitted resource task scheduling in grid computing. In: 7th International Conference on Computer Science & Education (ICCSE 2012), 14-17 July 2012, Melbourne, Australia. (pp. 331-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.

Download File

Text (Abstract)
Checkpointing in selected most fitted resource task scheduling in grid computing.pdf
Download (35kB)

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Computer Science and Information Technology
DOI Number:	https://doi.org/10.1109/ICCSE.2012.6295085
Publisher:	IEEE
Keywords:	Fault tolerance; Checkpointing; GridSim; Job scheduling; Grid computing
Depositing User:	Nabilah Mustapa
Date Deposited:	04 Aug 2020 02:43
Last Modified:	04 Aug 2020 02:43
Altmetrics:	http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1109/ICCSE.2012.6295085
URI:	http://psasir.upm.edu.my/id/eprint/45216
Statistic Details:	View Download Statistic

Actions (login required)

View Item