Open AccessA Fault Tolerant Scheduling Model for Directed Acyclic Graphs in Cloud
Author(s) -
Pedro Henrique Di Francia Rosso,
Emílio Francesquini
Publication year - 2020
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5753/eradsp.2020.16883
Subject(s) - computer science , distributed computing , cloud computing , scheduling (production processes) , fault tolerance , workflow , job shop scheduling , directed acyclic graph , operating system , database , algorithm , schedule , economics , operations management
Many High Performance Computing (HPC) and resource intensive applications have been tested and migrated to the Cloud. These applications may have high data input size, which often has a high correlation to execution performance and time. Migration to the Cloud demands adaptation of the fault tolerance (FT) and scheduling approaches. Although those topics are well connected, they are often treated separately. This work proposes a novel integrated scheduling and FT model which takes into account the characteristics of the tasks and the target execution nodes. Preliminary results indicate good potential to improve system reliability and execution makespan of scientific workflows.