Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Lehman, Tomer Lev"'
Recoverable algorithms tolerate failures and recoveries of processes by using non-volatile memory. Of particular interest are self-implementations of key operations, in which a recoverable operation is implemented from its non-recoverable counterpart
Externí odkaz:
http://arxiv.org/abs/2308.03485
