Combining replication and checkpointing redundancies for reducing resiliency overhead

• Main Author: Hassan Motallebi
• Format: Article
• Language: English
• Published: Electronics and Telecommunications Research Institute (ETRI) 2020-04-01
• Series: ETRI Journal
• Subjects: concurrency graph; extended upward rank; fault‐tolerant scheduling; hybrid redundancy; resiliency overhead
• Online Access: https://doi.org/10.4218/etrij.2018-0684

AbstractWe herein propose a heuristic redundancy selection algorithm that combines resubmission, replication, and checkpointing redundancies to reduce the resiliency overhead in fault‐tolerant workflow scheduling. The appropriate combination of these redundancies for workflow tasks is obtained in two consecutive phases. First, to compute the replication vector (number of task replicas), we apportion the set of provisioned resources among concurrently executing tasks according to their needs. Subsequently, we obtain the optimal checkpointing interval for each task as a function of the number of replicas and characteristics of tasks and computational environment. We formulate the problem of obtaining the optimal checkpointing interval for replicated tasks in situations where checkpoint files can be exchanged among computational resources. The results of our simulation experiments, on both randomly generated workflow graphs and real‐world applications, demonstrated that both the proposed replication vector computation algorithm and the proposed checkpointing scheme reduced the resiliency overhead.