Title:
|
Unified fault-tolerance framework for hybrid task-parallel message-passing applications
|
Author:
|
Subasi, Omer; Martsinkevich, Tatiana; Zyulkyarov, Ferad; Unsal, Osman; Labarta Mancho, Jesús José; Cappello, Franck
|
Other authors:
|
Barcelona Supercomputing Center |
Abstract:
|
We present a unified fault-tolerance framework for task-parallel message-passing applications to mitigate transient errors. First, we propose a fault-tolerant message-logging protocol that only requires the restart of the task that experienced the error and transparently handles any message passing interface calls inside the task. In our experiments we demonstrate that our fault-tolerant solution has a reasonable overhead, with a maximum observed overhead of 4.5%. We also show that fine-grained parallelization is important for hiding the overheads related to the protocol as well as the recovery of tasks. Secondly, we develop a mathematical model to unify task-level checkpointing and our protocol with system-wide checkpointing in order to provide complete failure coverage. We provide closed formulas for the optimal checkpointing interval and the performance score of the unified scheme. Experimental results show that the performance improvement can be as high as 98% with the unified scheme. |
Abstract:
|
The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported by the FI-DGR 2013 scholarship
and the European Community’s Seventh Framework Programme [FP7/2007-2013] under the Mont-blanc 2 Project (www.montblanc-project.eu), grant agreement no. 610402 and TIN2015-65316-P. |
Abstract:
|
Peer Reviewed |
Subject(s):
|
-Àrees temàtiques de la UPC::Enginyeria electrònica -Fault-tolerant computing -Mathematical modeling and computation -Fault-tolerance -Message logging -Checkpoint/restart -Task-based programming model -Optimal checkpointing interval -Models matemàtics -Programació (Ordinadors) |
Rights:
|
|
Document type:
|
Article - Submitted version Article |
Published by:
|
SAGE Publications
|
Share:
|
|