一句话：提出释放持久性模型与惰性实现机制，保证崩溃时 NVM 含一致割，从而加速无日志数据结构恢复。
无日志数据结构依赖持久内存原语在崩溃后仍保留可恢复状态。现有基于 acquire-release persistency 的单侧持久屏障不足以保证恢复，必须退回到昂贵的全屏障。本文强化单侧屏障语义，提出释放持久性（RP），保证崩溃时 NVM 保存执行的一致割，从而满足无日志数据结构的正确恢复条件。为高效实现 RP 的单侧屏障，进一步提出惰性释放持久性（LRP）微架构机制。作者在 5 个常用无日志数据结构上评估 LRP，相比最先进的全屏障实现获得 14%-44% 的性能提升。
Fast non-volatile memory (NVM) has sparked interest in log-free data structures (LFDs) that enable crash recovery without the overhead of logging. However, recovery hinges on primitives that provide guarantees on what remains in NVM upon a crash. While ordering and atomicity are two well-understood primitives, we focus on ordering and its efficacy in enabling recovery of LFDs. We identify that one-sided persist barriers of acquire-release persistency (ARP)--the state-of-the-art ordering primitive and its microarchitectural implementation--are not strong enough to enable recovery of an LFD. Therefore, correct recovery necessitates the inclusion of the more expensive full barriers. In this paper, we propose strengthening the one-sided barrier semantics of ARP. The resulting persistency model, release persistency (RP), guarantees that NVM will hold a consistent-cut of the execution upon a crash, thereby satisfying the criterion for correct recovery of an LFD. We then propose lazy release persistency (LRP), a microarchitectural mechanism for efficiently enforcing RP's one-sided barriers. Our evaluation on 5 commonly used LFDs suggests that LRP provides a 14%-44% performance improvement over the state-of-the-art full barrier.
DOI 原文 ·
@inproceedings{paperbot5452,
title = {Lazy Release Persistency},
author = {Mahesh Dananjaya and Vasilis Gavrielatos and Arpit Joshi and Vijay Nagarajan},
booktitle = {ASPLOS},
year = {2020},
doi = {10.1145/3373376.3378481}
}