Steal, No-Force (Recovery)

From Algorithm Wiki
Revision as of 07:53, 10 April 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Steal, No-Force (Recovery)}} == Description == Recovery is the process of reverting back to a safe state prior to a system failure. With a Steal/No-Force policy, the recovery algorithm will write possibly uncommited data to memory, while not forcing all commits to memory. == Related Problems == Related: No-Steal, Force == Parameters == $n$: number of transactions before crash == Table of Algorithms == {| class="wikitable sortable" style="t...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

Recovery is the process of reverting back to a safe state prior to a system failure.

With a Steal/No-Force policy, the recovery algorithm will write possibly uncommited data to memory, while not forcing all commits to memory.

Related Problems

Related: No-Steal, Force

Parameters

$n$: number of transactions before crash

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
ARIES 1992 $O(n)$ $O(n)$? Exact Deterministic Time

References/Citation

https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/128765.128770