Bukhari, Saufi and Ku-Mahamud, Ku Ruhana and Morino, Hiroaki (2017) Dynamic ACO-based fault tolerance in grid computing. International Journal of Grid and Distributed Computing, 10 (12). pp. 117-124. ISSN 20054262

Full text not available from this repository. (Request a copy)

Abstract

Scheduling jobs in distributed conditions of grid computing is nearly impossible to have a completely fault-free system. It is important to integrate fault tolerance capability in the system so that the system can continue to run even in the presence of failure in addition to improving the scheduling process as well as reducing the possibility of faults. Typically, load balancing is not considered in the presence of failure and this may lead to an inefficient scheduling process despite having a good fault tolerance strategy. This paper presents an ant-based fault tolerance algorithm that used checkpoint and resubmission techniques with consideration of execution history in the pheromone updating process to enhance fault tolerance capability. Experimental results showed that the proposed algorithm has better performance as compared to other relevant algorithms in terms of execution time, success rate, and average turnaround time per job.

Item Type:	Article
Uncontrolled Keywords:	Ant colony optimization, Ant colony system, Fault tolerance, Grid computing, Job scheduling
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	School of Computing
Depositing User:	Mrs. Norazmilah Yaakub
Date Deposited:	11 Nov 2020 06:07
Last Modified:	11 Nov 2020 06:07
URI:	https://repo.uum.edu.my/id/eprint/27876

Actions (login required)

View Item