On the Design of Fault-Tolerant Scheduling Strategies Using Primary-Backup Approach for Computational Grids with Low Replication Costs

Qin, Zheng; Veeravalli, Bharadwaj; Tham, Chen-Khong

doi:10.1109/tc.2008.172

Cited by 85 publications

(55 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Passive replication scheme does not require fault diagnosis and it guarantees to recover all failed jobs. In such a scheme, only two copies of the job are scheduled on different processors [14].…”

Section: • Passive Replicationmentioning

confidence: 99%

“…Qin Zheng et al [14] proposed fault tolerant scheduling strategies for independent, dependent and hybrid jobs with low replication costs using primary-backup approach for computational grids. They analyzed the impact of precedence constraints on scheduling and overloading of backups of dependent jobs and showed that this it limits the schedulability and overloading efficiency significantly.…”

Section: Replicationmentioning

confidence: 99%

See 1 more Smart Citation

Survay on Job Scheduling, Load Balancing and Fault Tolerance Techniques for Computational Grids

Balasangameshwara¹

2015

Glob J Tech Optim

View full text Add to dashboard Cite

Computational grid is a network of loosely coupled, heterogeneous and geographically-dispersed computers acting together to perform a large compute-intensive job. In this article, we focus on the existing approaches to grid scheduling, load balancing and fault-tolerance problems. Although grid scheduling, load balancing and fault tolerance are active research areas in grid computing, these areas have largely been and continue to be developed independent of one another each focusing on different aspects of computing. Hence, in this survey, we hope to show that robust applications that can provide efficient results can be designed by collectively considering these areas. To this end, we first provide an introduction to the motivation, grid scheduling, load balancing and fault tolerance concepts of grid computing and discuss the works that have provided significant contributions to each of these areas since its inception until 2013. We discuss their advantages, disadvantages and analyze their suitability for usage in a dynamic grid environment. We conclude that, while important advancements have been made in each of these areas individually, high performance approaches that cumulatively consider these areas still remain to be explored. We also discuss the research work that is missing and what we believe the community should be considering. To the best of our knowledge, no such survey has been conducted in the literature up to now.

show abstract

Section: • Passive Replicationmentioning

confidence: 99%

Section: Replicationmentioning

confidence: 99%

Survay on Job Scheduling, Load Balancing and Fault Tolerance Techniques for Computational Grids

Balasangameshwara¹

2015

Glob J Tech Optim

View full text Add to dashboard Cite

show abstract

“…Static fault-tolerant scheduling algorithms are suitable for periodic tasks [18]. However, aperiodic tasks whose arrival times are not known a priori must be scheduled by dynamic faulttolerant scheduling algorithms [24], [25], [26]. Our work is focused on scheduling aperiodic and independent real-time tasks.…”

Section: Related Workmentioning

confidence: 99%

“…Nevertheless, our approach can be applied to dependent tasks because tasks having precedence constraints are equivalent to independent tasks by modifying ready times and deadlines of dependent tasks [18]. Moreover, fault-tolerant scheduling algorithms can be classified into two groups: preemptive scheduling [27], [28] and nonpreemptive scheduling [25], [26], [32], [33]. In a preemptive scheduling approach, an executing task can be preempted by another task.…”

Section: Related Workmentioning

confidence: 99%

QoS-Aware Fault-Tolerant Scheduling for Real-Time Tasks on Heterogeneous Clusters

Zhu

Qin

Qiu

2011

IEEE Trans. Comput.

109

View full text Add to dashboard Cite

Abstract-Fault-tolerant scheduling plays a significant role in improving system reliability of clusters. Although extensive fault-tolerant scheduling algorithms have been proposed for real-time tasks in parallel and distributed systems, quality of service (QoS) requirements of tasks have not been taken into account. This paper presents a fault-tolerant scheduling algorithm called QAFT that can tolerate one node's permanent failures at one time instant for real-time tasks with QoS needs on heterogeneous clusters. In order to improve system flexibility, reliability, schedulability, and resource utilization, QAFT strives to either advance the start time of primary copies and delay the start time of backup copies in order to help backup copies adopt the passive execution scheme, or to decrease the simultaneous execution time of the primary and backup copies of a task as much as possible to improve resource utilization. QAFT is capable of adaptively adjusting the QoS levels of tasks and the execution schemes of backup copies to attain high system flexibility. Furthermore, we employ the overlapping technology of backup copies. The latest start time of backup copies and their constraints are analyzed and discussed. We conduct extensive experiments to compare our QAFT with two existing schemes-NOQAFT and DYFARS. Experimental results show that QAFT significantly improves the scheduling quality of NOQAFT and DYFARS.

show abstract

“…There are many types of scheduling algorithms which are very well known; some of them are dynamic and static scheduling. In dynamic scheduling, the decision as to which processor executes a task and when is controlled by the runtime system [3]- [5]. There are many advantages of static scheduling which include the dependences and communications among the tasks in its scheduling decisions.…”

Section: Introductionmentioning

confidence: 99%

Implementation of Fault Tolerance Algorithm to Restore Affected Nodes in Scheduling Clusters

Hussen¹,

Elleithy²,

Razaque

2012

IJCNC

View full text Add to dashboard Cite

show abstract

On the Design of Fault-Tolerant Scheduling Strategies Using Primary-Backup Approach for Computational Grids with Low Replication Costs

Cited by 85 publications

References 14 publications

Survay on Job Scheduling, Load Balancing and Fault Tolerance Techniques for Computational Grids

Survay on Job Scheduling, Load Balancing and Fault Tolerance Techniques for Computational Grids

QoS-Aware Fault-Tolerant Scheduling for Real-Time Tasks on Heterogeneous Clusters

Implementation of Fault Tolerance Algorithm to Restore Affected Nodes in Scheduling Clusters

Contact Info

Product

Resources

About