Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3323165.3323166acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
announcement

Persistent Atomics for Implementing Durable Lock-Free Data Structures for Non-Volatile Memory (Brief Announcement)

Published: 17 June 2019 Publication History

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

[1]
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.
[2]
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.
[3]
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.04780
[4]
HMC Consortium. 2015. Hybrid Memory Cube Specification 2.1. Technical Report.
[5]
Tudor David, Aleksandar Dragojevic, Rachid Guerraoui, and Mihail Igor Zablotchi. 2017. Log-Free Concurrent Data Structures. Technical Report.
[6]
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.
[7]
Timothy L Harris. 2001. A pragmatic implementation of non-blocking linked-lists. In International Symposium on Distributed Computing. Springer, 300--314.
[8]
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.
[9]
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.
[10]
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.
[11]
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.
[12]
Aasheesh Kolli, Vaibhav Gogte, Ali Saidi, Stephan Diestelhorst, Peter M Chen,Satish Narayanasamy, and Thomas F Wenisch. 2017. Tarp: Translating acquire-release persistency.
[13]
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-profile
[14]
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/latest
[15]
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.
[16]
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.
[17]
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.
[18]
SNIA. 2017. Persistent Memory Atomics and Transactions v1.2. Technical Report.
[19]
SNIA. 2019. NVM PM Remote Access for High Availability v1.08. Technical Report.
[20]
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.
[21]
John David Valois. 1996. Lock-free data structures. (1996).
[22]
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.

Cited By

View all
  • (2024)Practical Persistent Multi-word Compare-and-Swap Algorithms for Many-core CPUsJournal of Information Processing10.2197/ipsjjip.32.100332(1003-1012)Online publication date: 2024
  • (2023)Hardware Support for Durable Atomic Instructions for Persistent Parallel Programming2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247729(1-6)Online publication date: 9-Jul-2023
  • (2021)PMFuzz: test case generation for persistent memory programsProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446691(487-502)Online publication date: 19-Apr-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SPAA '19: The 31st ACM Symposium on Parallelism in Algorithms and Architectures
June 2019
410 pages
ISBN:9781450361842
DOI:10.1145/3323165
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

In-Cooperation

  • EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2019

Check for updates

Author Tags

  1. compare-and-swap
  2. lock-free data structure
  3. persistent memory

Qualifiers

  • Announcement

Conference

SPAA '19

Acceptance Rates

SPAA '19 Paper Acceptance Rate 34 of 109 submissions, 31%;
Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25
37th ACM Symposium on Parallelism in Algorithms and Architectures
July 28 - August 1, 2025
Portland , OR , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)0
Reflects downloads up to 22 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Practical Persistent Multi-word Compare-and-Swap Algorithms for Many-core CPUsJournal of Information Processing10.2197/ipsjjip.32.100332(1003-1012)Online publication date: 2024
  • (2023)Hardware Support for Durable Atomic Instructions for Persistent Parallel Programming2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247729(1-6)Online publication date: 9-Jul-2023
  • (2021)PMFuzz: test case generation for persistent memory programsProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446691(487-502)Online publication date: 19-Apr-2021
  • (2021)BBB: Simplifying Persistent Programming using Battery-Backed Buffers2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA51647.2021.00019(111-124)Online publication date: Feb-2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media