TY - CHAP A1 - Gholami, Masoud A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Checkpoint Scheduling for Shared Usage of Burst-Buffers in Supercomputers T2 - Proceedings of the 47th International Conference on Parallel Processing Companion; SRMPDS 2018: The 14th International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems N2 - User-defined and system-level checkpointing have contrary properties. While user-defined checkpoints are smaller and simpler to recover, system-level checkpointing better knows the global system's state and parameters like the expected mean time to failure (MTTF) per node. Both approaches lead to non-optimal checkpoint time, intervals, sizes, or I/O bandwidth when concurrent checkpoints conflict and compete for it. We combine user-defined and system-level checkpointing to exploit the benefits and avoid the drawbacks of each other. Thus, applications frequently offer to create checkpoints. The system accepts such offers according to the current status and implied costs to recalculate from the last checkpoint or denies them, i.e., immediately lets continue the application without checkpoint creation. To support this approach, we develop economic models for multi-application checkpointing on shared I/O resources that are dedicated for checkpointing (e.g. burst-buffers) by defining an appropriate goal function and solving a global optimization problem. Using our models, the checkpoints of applications on a supercomputer are scheduled to effectively use the available I/O bandwidth and minimize the failure overhead (checkpoint creations plus recalculations). Our simulations show an overall reduction in failure overhead of all nodes of up to 30% for a typical supercomputer workload (HLRN). We can also derive the most cost effective burst-buffer bandwidth for a given node's MTTF and application workload. Y1 - 2018 U6 - https://doi.org/10.1145/3229710.3229755 SP - 44:1 EP - 44:10 ER - TY - CHAP A1 - Weinhold, Carsten A1 - Lackorzynski, Adam A1 - Bierbaum, Jan A1 - Küttler, Martin A1 - Planeta, Maksym A1 - Weisbach, Hannes A1 - Hille, Matthias A1 - Härtig, Hermann A1 - Margolin, Alexander A1 - Sharf, Dror A1 - Levy, Ely A1 - Gak, Pavel A1 - Barak, Amnon A1 - Gholami, Masoud A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander A1 - Lieber, Matthias A1 - Nagel, Wolfgang T1 - FFMK: A Fast and Fault-Tolerant Microkernel-Based System for Exascale Computing T2 - Software for Exascale Computing - SPPEXA 2016-2019 Y1 - 2019 U6 - https://doi.org/10.1007/978-3-030-47956-5_16 SP - 483 EP - 516 PB - Springer ER - TY - JOUR A1 - Gholami, Masoud A1 - Schintke, Florian T1 - IOSIG: Declarative I/O-Stream Properties Using Pragmas JF - Datenbank-Spektrum Y1 - 2022 U6 - https://doi.org/10.1007/s13222-022-00419-w VL - 22 IS - 2 SP - 109 EP - 119 PB - Springer Berlin Heidelberg ER - TY - CHAP A1 - Gholami, Masoud A1 - Schintke, Florian T1 - Combining XOR and Partner Checkpointing for Resilient Multilevel Checkpoint/Restart T2 - 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Y1 - 2021 U6 - https://doi.org/10.1109/IPDPS49936.2021.00036 SP - 277 EP - 288 ER - TY - CHAP A1 - Gholami, Masoud A1 - Schintke, Florian T1 - Multilevel Checkpoint/Restart for Large Computational Jobs on Distributed Computing Resources T2 - 2019 IEEE 38th Symposium on Reliable Distributed Systems (SRDS) Y1 - 2019 U6 - https://doi.org/10.1109/SRDS47363.2019.00025 SP - 143 EP - 152 ER - TY - JOUR A1 - Gholami, Masoud A1 - Schintke, Florian T1 - CAWL: A Cache-aware Write Performance Model of Linux Systems JF - arXiv Y1 - 2023 U6 - https://doi.org/10.48550/arXiv.2306.05701 SP - 1 EP - 22 ER - TY - GEN A1 - Gholami, Masoud A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - Modeling Checkpoint Schedules for Concurrent HPC Applications T2 - CoSaS 2018 International Symposium on Computational Science at Scale Y1 - 2018 ER -