Fault Tolerance in Grid using Ant colony Optimization and Directed Acyclic Graph

Modiri, Vahid; Analoui, Morteza; Jabbehdari, Sam

doi:10.5121/ijgca.2011.2102

Cited by 5 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rodero et al (2009) gives an evaluation of coordinated grid scheduling strategy with the FCFS job scheduling policy and the matchmaking approach for the resource selection as a reference. In order to allocate grid tasks in minimum time and to increase toleration of faults, Modiri et al (2011) uses DAG mechanism to enter tasks and thereby brings out an efficient algorithm namely ant colony optimization algorithm. Garg and Singh (2011) surveys the importance of fault tolerance for achieving reliability by all possible mechanisms such as Replication, Check pointing and job migration.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

Arwa¹

2012

American Journal of Applied Sciences

View full text Add to dashboard Cite

Grid computing serves as an important technology to facilitate distributed computation computational grids solve large scale scientific problems using heterogeneous geographically distributed resources. Problems like dispatching and scheduling of tasks are considered as major issues in computational grid environment. The Grid Scheduler must select proper resources for executing the tasks with less response time. There are various reasons such as network failure, overloaded resource conditions, or non-availability of required software components for execution failure. Thus, fault-tolerant systems should be able to identify and handle failures and support reliable execution in the presence of failures. Hence the integration of fault tolerance measures and communication time with scheduling gains much importance. In this study, a new fault tolerance based scheduling approach Fault Tolerant Min-Min (FTMM) for scheduling statically available meta tasks is proposed wherein failure rate and the fitness value are calculated. The performance of the fault tolerant scheduling policy is compared with min-min scheduling policy using GridSim and the results shows that the proposed policy performs better with less makespan in the presence of failures. The number of tasks successfully completed is also more when compared to the non-fault tolerant min-min scheduling policy. Thus the proposed FTMM algorithm not only achieves better hit rate but also improved makespan

show abstract

Section: Related Workmentioning

confidence: 99%

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

Arwa¹

2012

American Journal of Applied Sciences

View full text Add to dashboard Cite

show abstract

“…A minimum time to release job scheduling algorithm is proposed by Malarvizhi et al [8] in 2009 in which time to release (TTR) is evaluated. The tasks are arranged in descending order based on Time to Release (TTR) value.…”

Section: Introductionmentioning

confidence: 99%

Efficient load balancing scheduling for deadline constrained tasks on grid computing

Jindal

Bansal

2014

2014 9th International Conference on Industrial and Information Systems (ICIIS)

View full text Add to dashboard Cite

Grid Computing provides scalable access to widearea distributed resources. Since, computational grid selects, shares and aggregates wide variety of geographically distributed computing resources and proposes them as a single resource for solving large scale computing applications but there is a need for a scheduling algorithm which takes into account the several requirements of grid environment. Hence, this research proposes a new scheduling algorithm for computational grids that considers user satisfaction, load balancing; fault tolerance based on the resource availability and job characteristics such as user deadline. This algorithm decreases the make-span of the schedule along with user satisfaction means more tasks are successfully completed within user deadline and balanced load means load on all the resources is balanced. The proposed algorithm improves the system parameter such as maximum variation in load; deadline hit count and make-span as compared to BSA.

show abstract

“…A study by Modiri et al (2011) proposed a new algorithm to manage fault in grid computing by combining the ACS algorithm and Directed Acyclic Graph (DAG) method. By using the DAG method, all tasks are sorted by their dependency.…”

Section: Related Workmentioning

confidence: 99%

“…ACO is flexible to be modified and combined with other nature-inspired swarm intelligence approaches such as Intelligent Water Drop (IWD) to speed up optimal scheduling, in addition to minimizing make span, balancing the load and utilizing resources efficiently (Mathiyalagan et al, 2013). Modiri et al (2011) combined the ACS algorithm with the Directed Acyclic Graph (DAG) method to cater both load balancing and fault tolerance aspects whereby scheduling process adopted DAG method and fault tolerance adopted ACS algorithm.…”

Section: Introductionmentioning

confidence: 99%

Fault Tolerance Grid Scheduling with Checkpoint Based on Ant Colony System

Bukhari¹,

Ku-Mahamud²,

Morino

2017

Journal of Computer Science

View full text Add to dashboard Cite

Task resubmission and checkpoint are among several popular techniques used in providing fault tolerance in grid computing. However, due to the lack of side-by-side comparison, it is not certain of the best technique that would not degrade the system performance in addition to providing fault tolerance capability. This study proposed Dynamic ACSbased Fault Tolerance in grid computing using resubmission to new resource, checkpoint technique and utilization of resource execution history with the aim to reduce execution and task processing time and to increase the success rate in grid environment. The proposed algorithm is compared with other relevant algorithms to measure the performance in terms of execution time, success rate and average processing time. The results suggest that the proposed algorithm with improved task resubmission, checkpoint and extended pheromone update formula gives better performance in managing execution failure as well as resource selection during task assignment or resubmission.

show abstract

Fault Tolerance in Grid using Ant colony Optimization and Directed Acyclic Graph

Cited by 5 publications

References 10 publications

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

Efficient load balancing scheduling for deadline constrained tasks on grid computing

Fault Tolerance Grid Scheduling with Checkpoint Based on Ant Colony System

Contact Info

Product

Resources

About