Dynamic ACO-based fault tolerance in grid computing

Saufi Bukhari, Ku Ruhana Ku-Mahamud, Hiroaki Morino

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)117-124
Number of pages8
JournalInternational Journal of Grid and Distributed Computing
Volume10
Issue number12
DOIs
Publication statusPublished - 2017 Jan 1

Keywords

  • Ant colony optimization
  • Ant colony system
  • Fault tolerance
  • Grid computing
  • Job scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Dynamic ACO-based fault tolerance in grid computing'. Together they form a unique fingerprint.

  • Cite this