Checkpointing à la Young/Daly: An Overview

Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing Pub Date : 2022-08-04 DOI:10.1145/3549206.3549328

A. Benoit, Yishu Du, T. Hérault, L. Marchal, Guillaume Pallez, Lucas Perotin, Y. Robert, Hongyang Sun, F. Vivien

引用次数: 1

Abstract

The Young/Daly formula provides an approximation of the optimal checkpoint period for a parallel application executing on a supercomputing platform. The Young/Daly formula was originally designed for preemptible tightly-coupled applications. We provide some background and survey various application scenarios to assess the usefulness and limitations of the formula.

查看原文本刊更多论文

检查点(la Young/Daly):概述

Young/Daly公式为在超级计算平台上执行的并行应用程序提供了最佳检查点周期的近似值。Young/Daly公式最初是为不可抢占的紧密耦合应用而设计的。我们提供了一些背景和调查各种应用场景，以评估该公式的有用性和局限性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing

自引率

0.00%

发文量