Efficient algorithms for persistent transactional memory
Year: 2021
Type: conference-paper
Abstract: 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.
Institutions: Cisco Systems (United States), University of Neuchâtel
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3130392236
