← Mathematical compendium

Published equation contexts

Topt≈2 C MT_{\text{opt}} \approx \sqrt{2\,C\,M}

Why this formula appears here

The underlying trade-off is a classical one from checkpoint/restart theory, and it is worth making explicit because it is the model every specific policy below is an instance of. If a checkpoint costs a fixed time C to write and failures arrive with mean time between them M , then choosing a checkpoint interval T trades two costs against each other: writing more often burns time on overhead, and writing less often burns time re-doing work lost since the last save. Minimising the sum of those two costs — checkpoint overhead C/T plus expected rework T/2M — over T gives the classical optimum: Topt≈2 C MT_{\text{opt}} \approx \sqrt{2\,C\,M}. The consequence that matters operationally is that ToptT_{\text{opt}} shrinks as M…

Read the full article-specific guide →

Read the representative guide

ToptT_{\text{opt}}

Symbol T_opt

ToT_opt is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →
CC

Symbol C

C is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →
MM

Symbol M

M is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →

How to interpret it

Its accuracy depends on the assumptions and range of use described in the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

Topt≈2 C MT_{\text{opt}} \approx \sqrt{2\,C\,M}

Equation 7 · Datacenters

AI Datacenter Systems Engineering in Practice: An Advanced Technical Guide

This equation gives an approximation: it relates the quantities while allowing an approximation.

The underlying trade-off is a classical one from checkpoint/restart theory, and it is worth making explicit because it is the model every specific policy below is an instance of. If a checkpoint costs a fixed time C to write and failures arrive with mean time between them M , then choosing a checkpoint interval T trades two costs against each other: writing more often burns time on overhead, and writing less often burns time re-doing work lost since the last save. Minimising the sum of those two costs — checkpoint overhead C/T plus expected rework T/2M — over T gives the classical optimum: Topt≈2 C MT_{\text{opt}} \approx \sqrt{2\,C\,M}. The consequence that matters operationally is that ToptT_{\text{opt}} shrinks as M…

Equation guide → · Article →