Fault-Tolerant Scheduling Techniques for Computational Grid

Besides the dynamic nature of grids which means that resources may enter and leave the grid at any time, in many cases outside of the applications control, grid resources are also heterogeneous in nature. Many grid applications will be running in environments where interaction faults are Fault more likely to occur between disparate grid nodes. As resources may also be used outside of organizational boundaries, it becomes increasingly difficult to guarantee that a resource being used is not malicious. Due to the diverse faults and failure conditions, developing, deploying, and executing long running applications over the grid remains a challenge. So Fault-tolerant scheduling is an imperative step for large-scale computational Grid systems, as often geographically distributed nodes co-operate to execute a task. One Motivation of Grid computing is to aggregate the power of widely distributed resources, and provide non-trivial services to users. To achieve this goal, an efficient Grid scheduling system is an essential part of the Grid. This paper presents an extensive survey of different fault tolerant scheduling Technique such as Distributed Fault Tolerant Scheduling (DFTS) algorithm, Volunteer Availability based Tolerant Scheduling (VAFTS) algorithm, A Reliability Cost Driven (RCD) Scheduling, A Dynamic Reliability-Cost-Driven (DRCD) Scheduling Algorithm, An Efficient fault-tolerant scheduling algorithm (eFRD), contention-aware fault-tolerant (CAFT) scheduling algorithm, eFRCD (efficient Fault-tolerant Reliability Cost Driven Algorithm).