A Resource Management System for Fault Tolerance in Grid Computing

Lee, HwaMin; Park, DooSoon; Min, Hong; Yeo, Sang-Soo; Kim, Soo-Kyun; Kim, Sung Hoon

doi:10.1109/cse.2009.257

Cited by 11 publications

(7 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results show that general adaptive scheduling heuristics that includes QoS guidance provides significant performance gain. A fault tolerance service based on different types of failures satisfying the QoS requirements is explained by Lee et al (2009). It also gives a resource scheduling service, detection of faults and over usage of resources and fault management service.…”

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

“…Fault-tolerant is an ability of preserving the delivery of expected services by self, despite the presence of failures within the grid. The various forms of failures in grid computing systems include resource failure, network failure, and application failure [5]. Providing faulttolerant service in a grid environment, while optimizing resource scheduling and task execution, is an important issue.…”

Section: Introductionmentioning

confidence: 99%

“…Providing faulttolerant service in a grid environment, while optimizing resource scheduling and task execution, is an important issue. In computational grids, managing the fault is a very important and challenging problem for grid application developers [5].…”

Section: Introductionmentioning

confidence: 99%

A novel fault-tolerant task scheduling algorithm for computational grids

Naik

Satyanarayana²

2013

2013 15th International Conference on Advanced Computing Technologies (ICACT)

View full text Add to dashboard Cite

A computational grid is a hardware and software infrastructure that provides consistent, dependable, pervasive and expensive access to high-end computational capabilities in a multi-institutional virtual organization. Computational grids provide computing power needed for execution of tasks. Scheduling the task in computing grid is an important problem. To select and assign the best resources for task, we need a good scheduling algorithm in grids. As grids typically consist of strongly varying and geographically distributed resources, choosing a fault-tolerant computational resource is an important issue. The main scheduling strategy of most fault-tolerant scheduling algorithms depends on the response time and fault indicator when selecting a resource to execute a task. In this paper, a scheduling algorithm is proposed to select the resource, which depends on a new factor called Scheduling Success indicator (SSI). This factor consists of the response time, success rate and the predicted Experience of grid resources. Whenever a grid scheduler has tasks to schedule on grid resources, it uses the Scheduling Success indicator to generate the scheduling decisions. The main scheduling strategy of the Fault-tolerant algorithm is to select resources that have lowest tendency to fail and having more experience in task execution. Extensive experiment simulations are conducted to quantify the performance of the proposed algorithm on GridSim. GridSim is a Java based discrete-event Grid simulation toolkit. Experiments have shown that the proposed algorithm can considerably improve grid performance in terms of throughput, failure tendency and worth.

show abstract

“…A fault tolerance service based on different types of failures satisfying the QoS requirements is proposed in [4]. It has a fault detector, fault manager, resource manager, resource allocation manager, meta computing directory service, and execution time predictor.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

Keerthika¹,

Suresh²

2015

The Scientific World Journal

View full text Add to dashboard Cite

Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue since it has to consider several requirements such as system load, processing cost and time, user's deadline, and resource failure. This work attempts to design a resource allocation algorithm which is budget constrained and also targets load balancing, fault tolerance, and user satisfaction by considering the above requirements. The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization. The proposed MLFT algorithm is evaluated using Gridsim toolkit and the results are compared with the recent algorithms which separately concentrate on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts.

show abstract

A Resource Management System for Fault Tolerance in Grid Computing

Cited by 11 publications

References 13 publications

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

A novel fault-tolerant task scheduling algorithm for computational grids

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

Contact Info

Product

Resources

About