An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems.

Autor: Idris H; Department of Mathematics, Ahmadu Bello University Zaria, Nigeria., Ezugwu AE; Department of Computer Science, Federal University Lafia, Nasarawa State, Nigeria.; School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Westville Campus, Durban, South Africa., Junaidu SB; Department of Mathematics, Ahmadu Bello University Zaria, Nigeria., Adewumi AO; School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Westville Campus, Durban, South Africa.
Jazyk: angličtina
Zdroj: PloS one [PLoS One] 2017 May 17; Vol. 12 (5), pp. e0177567. Date of Electronic Publication: 2017 May 17 (Print Publication: 2017).
DOI: 10.1371/journal.pone.0177567
Abstrakt: The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user's Quality of Service (QoS) requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO) algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user's QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time.
Databáze: MEDLINE