Sentence examples for optimal checkpoint from inspiring English sources

In the case of IR-induced DSBs, γ-H2AX is ATM-dependent, which is involved in the amplification step required for optimal checkpoint response in the DDR.

Finally based on a previous study that MAD1 and MAD2 gene dosage needs to be balanced for optimal checkpoint function (Barnhart et al. 2011), we introduced a MoBY plasmid carrying MAD2 into the strain with the MAD1 plasmid.

The algorithm improves upon previous work via the simplicity and speed of the calculation for the index of the optimal checkpoint, and via achievement of optimal performance for a problem of arbitrary size.

If this distinction makes implementation of the advance callback routine difficult, it may be prudent to compute and permanently store the first stage in the first memory location, and to run the optimal checkpointing algorithm so as to provide an optimally computed backtrace through the remaining N−1 stages using M−1 memory locations.

Another approach to this issue is an optimal checkpointing strategy that is used to ensure the availability of a given system [33, 34].

Third, for large-scale data, the combinatorial strategy for optimal checkpointing and efficient boundary storage is introduced for the trade-off between memory and recomputation.

Herein we will describe an optimal checkpointing strategy that provably minimizes the number of stage re-computations necessary in performing a backtrace with limited high-speed memory.

Results: Here we present an optimal checkpointing strategy, and demonstrate its utility with pairwise local sequence alignment of sequences of length 10 000.

Wheeler and Hughey (2000) also discuss (L, L−1, … -level algorithms and an optimal checkpointing algorithm, but do not provide a quick computation for choosing optimal checkpoints, nor do they give formulae to compute the number of stage computations for general values of M and N. The choice of the stages to checkpoint can be framed as an optimization problem.

Thus, with an optimal choice for C, we have the recursion for T M,N): (6) Note that Wheeler and Hughey (2000) give a different recursion for optimal checkpointing.

We write T M,N) for the number of stage computations that are needed by the optimal checkpointing algorithm for a backtrace through N stages, using room for M stages.