William Wang
ABSTRACT
This brief announcement presents a persist ordering problem uncovered in implementing durable lock-free data structures for non-volatile memory, and proposes a hardware solution with persistent atomics in the Arm instruction set architecture.
References
- Mihnea Andrei, Christian Lemke, Günter Radestock, Robert Schulze, Carsten Thiel, Rolando Blanco, Akanksha Meghlan, Muhammad Sharique, Sebastian Seifert, Surendra Vishnoi, et al. 2017. SAP HANA adoption of non-volatile memory. Proceedings of the VLDB Endowment 10, 12 (2017), 1754--1765. Google Scholar
Digital Library
- Joy Arulraj, Justin Levandoski, Umar Farooq Minhas, and Per-Ake Larson. 2018. Bztree: A high-performance latch-free range index for non-volatile memory. Proceedings of the VLDB Endowment 11, 5 (2018), 553--565.Google ScholarDigital Library
- Naama Ben-David, Guy E. Blelloch, and Yuanhao Wei. 2018. Making Concurrent Algorithms Detectable. CoRRabs/1806.04780 (2018). arXiv:1806.04780 http://arxiv.org/abs/1806.04780Google Scholar
- HMC Consortium. 2015. Hybrid Memory Cube Specification 2.1. Technical Report.Google Scholar
- Tudor David, Aleksandar Dragojevic, Rachid Guerraoui, and Mihail Igor Zablotchi. 2017. Log-Free Concurrent Data Structures. Technical Report.Google Scholar
- Michal Friedman, Maurice Herlihy, Virendra Marathe, and Erez Petrank. 2018. A persistent lock-free queue for non-volatile memory. In Proceedings of the 23rdACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.ACM, 28--40.Google ScholarDigital Library
- Timothy L Harris. 2001. A pragmatic implementation of non-blocking linked-lists. In International Symposium on Distributed Computing. Springer, 300--314. Google ScholarDigital Library
- Yihe Huang, Matej Pavlovic, Virendra Marathe, Margo Seltzer, Tim Harris, and Steve Byan. 2018. Closing the performance gap between volatile and persistent key-value stores using cross-referencing logs. In 2018 (USENIX)Annual Technical Conference ({USENIX}{ATC}18). USENIX Association, 967--979. Google ScholarDigital Library
- Joseph Izraelevitz, Hammurabi Mendes, and Michael L Scott. 2016. Brief announcement: Preserving happens-before in persistent memory. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 157--159.Google ScholarDigital Library
- Joseph Izraelevitz, Hammurabi Mendes, and Michael L Scott. 2016. Lineariz-ability of persistent memory objects under a full-system-crash failure model. In International Symposium on Distributed Computing. Springer, 313--327.Google ScholarCross Ref
- Aasheesh Kolli, Vaibhav Gogte, Ali Saidi, Stephan Diestelhorst, Peter M Chen, Satish Narayanasamy, and Thomas F Wenisch. 2017. Language-level persistency. InComputer Architecture (ISCA), 2017 ACM/IEEE 44th Annual International Symposium on. IEEE, 481--493. Google ScholarDigital Library
- Aasheesh Kolli, Vaibhav Gogte, Ali Saidi, Stephan Diestelhorst, Peter M Chen,Satish Narayanasamy, and Thomas F Wenisch. 2017. Tarp: Translating acquire-release persistency.Google Scholar
- Arm Ltd. 2016. ARM Architecture Reference Manual ARMv8, for ARMv8-A architecture profile. Technical Report. https://developer.arm.com/docs/ddi0487/a/arm-architecture-reference-manual-armv8-for-armv8-a-architecture-profileGoogle Scholar
- Arm Ltd. 2016. ARM Architecture Reference Manual Supplement ARM v8.1, for ARM v8-A architecture profile Documentation. Technical Report. https://developer.arm.com/docs/ddi0557/latestGoogle Scholar
- Darko Makreshanski, Justin Levandoski, and Ryan Stutsman. 2015. To lock,swap, or elide: On the interplay of hardware transactional memory and lock-free indexing. Proceedings of the VLDB Endowment 8, 11 (2015), 1298--1309. Google ScholarDigital Library
- Maged M Michael and Michael L Scott. 1995.Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. Technical Report. ROCHESTER UNIV NY DEPT OF COMPUTER SCIENCE.Google Scholar
- Matej Pavlovic, Alex Kogan, Virendra J Marathe, and Tim Harris. 2018. Brief Announcement: Persistent Multi-Word Compare-and-Swap. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. ACM, 37--39.Google ScholarDigital Library
- SNIA. 2017. Persistent Memory Atomics and Transactions v1.2. Technical Report.Google Scholar
- SNIA. 2019. NVM PM Remote Access for High Availability v1.08. Technical Report.Google Scholar
- John D Valois. 1995. Lock-free linked lists using compare-and-swap. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing. ACM, 214--222. Google ScholarDigital Library
- John David Valois. 1996. Lock-free data structures. (1996).Google Scholar
- Tianzheng Wang, Justin Levandoski, and Per-Ake Larson. 2018. Easy lock-free indexing in non-volatile memory. In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 461--472.Google ScholarCross Ref
Index Terms
Persistent Atomics for Implementing Durable Lock-Free Data Structures for Non-Volatile Memory (Brief Announcement)
Comments