Efficient algorithms for persistent transactional memory
Pedro Ramalhete, Andreia Correia, Pascal A. Felber · 2021
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.