Swap 的可恢复与可检测自实现
Recoverable and Detectable Self-Implementations of Swap
AI总结：
本文提出 SWAP 操作的两种可恢复自实现，分别适用于系统级故障和独立故障模型，并证明恢复代码的阻塞性在独立故障模型中不可避免。
摘要：
可恢复算法利用非易失性存储器容忍进程的故障与恢复。特别值得关注的是关键操作的自实现，其中可恢复操作由其不可恢复的对应操作（以及读和写）实现。本文提出了 SWAP 操作的两种自实现。一种工作在系统级故障模型中，在该模型中所有进程一起故障并一起恢复；另一种工作在独立故障模型中，在该模型中每个进程独立于其他进程崩溃和恢复。两种算法在无崩溃执行中都是无等待的，但它们的恢复代码是阻塞的。我们证明了这在独立故障模型中是固有的。该不可能性结果针对使用干扰函数的可区分操作的实现得到证明，并且特别适用于 swap 的可恢复自实现。
英文摘要：
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 (in addition to reads and writes). This paper presents two self-implementations of the SWAP operation. One works in the system-wide failures model, where all processes fail and recover together, and the other in the independent failures model, where each process crashes and recovers independently of the other processes. Both algorithms are wait-free in crash-free executions, but their recovery code is blocking. We prove that this is inherent for the independent failures model. The impossibility result is proved for implementations of distinguishable operations using interfering functions, and in particular, it applies to a recoverable self-implementation of swap.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
