• Corpus ID: 22053514

Task Scheduling and Seedblock Based Fault Tolerance in Cloud

  title={Task Scheduling and Seedblock Based Fault Tolerance in Cloud},
  author={B. Arunkumar},
Cloud computing is one of the essential paradigms of concern to the data sharing resources and utilization of data computation in data centers. Resource services in cloud computing is widely used these days. Cloud computing has a main drawback of fault tolerance. Maintaining of the fault tolerance is a necessity in providing availability and reliability of critical services in cloud services. The existing fault tolerant techniques use the Primary Backup (PB) model to backup the tasks of… 
1 Citations

Figures from this paper

Generating Fault Tolerance Mechanism in Cloud Computing System using EDP - PART 2
  • B. Kumar
  • Computer Science
    International Journal for Research in Applied Science and Engineering Technology
  • 2019
A novel algorithm as Part 2 of EDP (Error Detection Program), which will collect all the errors from Part 1 module and resolve them by using task re-submission method in reactive fault tolerance.


FESTAL: Fault-Tolerant Elastic Scheduling Algorithm for Real-Time Tasks in Virtualized Clouds
A novel fault-tolerant elastic scheduling algorithms for real-time tasks in clouds named FESTAL is designed, aiming at achieving both fault tolerance and high resource utilization in clouds, and an elastic resource provisioning mechanism is proposed for the first time.
Task Scheduling Algorithm with Fault Tolerance for Cloud
An improved balance reduce algorithm, an enhancement of BAR algorithm for handling machine failure, and an algorithm which is similar to primary backup approach are proposed, which will reduce the job completion time effectively when failure happens.
QoS-Aware Fault-Tolerant Scheduling for Real-Time Tasks on Heterogeneous Clusters
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 is presented.
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
This work addresses the scheduling of dynamically arriving real-time tasks with PB fault-tolerant requirements onto a set of processors in such a way that the versions of the tasks are feasible in the schedule.
On the Design of Fault-Tolerant Scheduling Strategies Using Primary-Backup Approach for Computational Grids with Low Replication Costs
This paper identifies two cases that may happen when scheduling dependent tasks with primary-backup approach, and derives two important constraints that must be satisfied, which play a crucial role in limiting the schedulability and overloading efficiency of backups of dependent tasks.
Performance-Driven Load Balancing with a Primary-Backup Approach for Computational Grids with Low Communication Cost and Replication Cost
The main objective is to arrive at job assignments that could achieve minimum response time, maximum resource utilization, and a well-balanced load across all the resources involved in a grid.
Scheduling fault-tolerant distributed hard real-time tasks independently of the replication strategies
  • Pascal Chevochot, I. Puaut
  • Computer Science
    Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306)
  • 1999
This paper describes a framework for taking into account the replicated tasks in scheduling algorithms that is largely independent of the replication technique and shows on an example that the same scheduling algorithm can be used whatever replication strategy is selected, even if several replication strategies are simultaneously used.