Optimizing Persistent Memory Transactions

Optimizing Persistent Memory Transactions
复制标题

DOI:
10.1109/pact.2019.00025
复制
发表时间:
2019-09
期刊:
2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT)
影响因子:
--
通讯作者:
P. Zardoshti;Tingzhe Zhou;Yujie Liu;Michael F. Spear
P. Zardoshti;Tingzhe Zhou;Yujie Liu;Michael F. Spear
中科院分区:
其他
文献类型:
--
作者:
P. Zardoshti;Tingzhe Zhou;Yujie Liu;Michael F. Spear

文献摘要

被引文献

相似文献

字节可寻址、非易失性随机存取存储器(NVM)有可能显著提高存储密集型工作负载的性能。对于具有不规则数据访问模式的应用程序以及依赖于自组织数据结构的应用程序,与NVM交互的最有希望的模型是事务模型。然而,该模型的具体细节非常重要。我们介绍了两种编程持久事务的模型。我们展示了如何从传统的软件事务存储器构建并发持久事务存储器。然后,我们介绍了一般的和特定于模型的优化,可以大大提高持久性事务的性能。我们的评估表明,持久事务的延迟和可扩展性都有了很大的改善。
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.