Optimizing Persistent Memory Transactions

Byte-addressable, non-volatile, random access memory (NVM) has the potential to dramatically accelerate the performance of storage-intensive workloads. For applications with irregular data access patterns, and applications that rely on ad-hoc data structures, the most promising model for interacting...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings / International Conference on Parallel Architectures and Compilation Techniques pp. 219 - 231
Main Authors: Zardoshti, Pantea, Zhou, Tingzhe, Liu, Yujie, Spear, Michael
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2019
Subjects:
Concurrency
Hardware
Non volatile Memory
Nonvolatile memory
Optimization
Persistence
Programming
Random access memory
Scalability
Synchronization
Throughput
Transactional Memory
ISSN:2641-7936
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Byte-addressable, non-volatile, random access memory (NVM) has the potential to dramatically accelerate the performance of storage-intensive workloads. For applications with irregular data access patterns, and applications that rely on ad-hoc data structures, the most promising model for interacting with NVM is a transactional model. However, the specifics of the model matter significantly. We introduce two models for programming persistent transactions. We show how to build concurrent persistent transactional memory from traditional software transactional memories. We then introduce general and model-specific optimizations that can substantially improve the performance of persistent transactions. Our evaluation shows a substantial improvement in the both the latency and scalability of persistent transactions.
ISSN:2641-7936
DOI:10.1109/PACT.2019.00025