Efficient algorithms for persistent transactional memory

Pedro Ramalhete; Andreia Correia; Pascal Felber

doi:10.1145/3437801.3441586

PPoPP2021顶会

Efficient algorithms for persistent transactional memory

Pedro Ramalhete, Andreia Correia, Pascal Felber

DOI 出版方

2021年份

17被引次数

7顶会引用

摘要

Durable techniques coupled with transactional semantics provide to application developers the guarantee that data is saved consistently in persistent memory (PM), even in the event of a non-corrupting failure. Persistence fences and flush instructions are known to have a significant impact on the throughput of persistent transactions.

问问这篇 Paper

问问你的智能体。

Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。

核心论断
谁在沿用
横向对比
局限

你的问题

智能体调用

Lunesearch_papers

在 Lune 里问

免费开始，无需绑卡

引用它的顶会 Paper7

HTMFS: Strong Consistency Comes for Free with Hardware Transactional Memory in Persistent Memory File SystemsJifei Yi, Mingkai Dong, Fangnuo Wu, Haibo ChenFAST 2022 · 被引用 19 次
ResPCT: fast checkpointing in non-volatile memory for multi-threaded applicationsAna Khorguani, Thomas Ropars, Noel De PalmaEuroSys 2022 · 被引用 15 次
TENET: Memory Safe and Fault Tolerant Persistent Transactional MemoryMadhava Krishnan Ramanathan, Diyu Zhou, Wook-Hee Kim, Sudarsun Kannan 等FAST 2023 · 被引用 12 次
TL4x: Buffered Durable Transactions on Disk as Fast as in MemoryGal Assa, Andreia Correia, Pedro Ramalhete, Valerio Schiavoni 等PPoPP 2023 · 被引用 8 次
Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent MemorySimon Friis Vindum, Lars BirkedalOOPSLA 2023 · 被引用 6 次

问问它们各自怎么用它

摘要

问问这篇 Paper

问问你的智能体。

引用它的顶会 Paper7

相关 Paper