research-article

Scalable crash consistency for secure persistent memory

Authors:

Hao XuAuthors Info & Claims

DAC '22: Proceedings of the 59th ACM/IEEE Design Automation Conference

Pages 817 - 822

https://doi.org/10.1145/3489517.3530537

Published: 23 August 2022 Publication History

Abstract

Persistent memory (PM) suffers from data security and crash consistency issues due to non-volatility. Counter-mode encryption (CME) and bonsai merkle tree (BMT) have been adopted to ensure data security by using security metadata. The data and its security metadata need to be atomically persisted for correct recovery. To ensure crash consistency, durable transactions have been widely employed. However, the long-time BMT update increases the transaction latency, and the security metadata incur heavy write traffic. This paper presents Secon to ensure SEcurity and crash CONsistency for PM with high performance. Secon leverages a scalable write-through metadata cache to ensure the atomicity of data and its security metadata. To reduce the transaction latency, Secon proposes a transaction-specific epoch persistency model to minimize the ordering constraints. To reduce the amount of PM writes, Secon co-locates counters with log entries and coalesces BMT blocks. Experimental results demonstrate that Secon significantly improves the transaction performance and decreases the write traffic.

References

[1]

2016. Deprecating the PCOMMIT Instruction. https://software.intel.com/content/www/us/en/develop/blogs/deprecate-pcommit-instruction.html.

[2]

A. Awad, P. K. Manadhata, S. Haber, Y. Solihin, and W. G. Horne. 2016. Silent Shredder: Zero-Cost Shredding for Secure Non-Volatile Main Memory Controllers. In ASPLOS.

Digital Library

[3]

A. Awad, M. Ye, Y. Solihin, L. Njilla, and K. A. Zubair. 2019. Triad-NVM: persistency for integrity-protected and encrypted non-volatile memories. In ISCA.

[4]

N. L. Binkert, B. M. Beckmann, G. Black, S. K. Reinhardt, A. G. Saidi, A. Basu, J. Hestness, D. Hower, T. Krishna, S. Sardashti, R. Sen, K. Sewell, M. S. B. Altaf, N. Vaish, M. D. Hill, and D. A. Wood. 2011. The gem5 simulator. SIGARCH Comput. Archit. News 39, 2 (2011).

Digital Library

[5]

D. R. Chakrabarti, H. Boehm, and K. Bhandari. 2014. Atlas: leveraging locks for non-volatile memory consistency. In OOPSLA.

[6]

A. Freij, S. Yuan, H. Zhou, and Y. Solihin. 2020. Persist Level Parallelism: Streamlining Integrity Tree Updates for Secure Persistent Memory. In MICRO.

[7]

A. Freij, H. Zhou, and Y. Solihin. 2021. Bonsai Merkle Forests: Efficiently Achieving Crash Consistency in Secure Persistent Memory. In MICRO.

[8]

B. Gassend, G. Edward Suh, D. E. Clarke, M. V. Dijk, and S. Devadas. 2003. Caches and Hash Trees for Efficient Memory Integrity Verification. In HPCA.

[9]

V. Gogte, W. Wang, S. Diestelhorst, P. M. Chen, S. Narayanasamy, and T. F. Wenisch. 2020. Relaxed Persist Ordering Using Strand Persistency. In ISCA.

[10]

J. Huang and Y. Hua. 2021. A Write-Friendly and Fast-Recovery Scheme for Security Metadata in Non-Volatile Memories. In HPCA.

[11]

S. K. Lee, J. Mohan, S. Kashyap, T. Kim, and V. Chidambaram. 2019. Recipe: converting concurrent DRAM indexes to persistent-memory indexes. In SOSP.

[12]

M. Liu, M. Zhang, K. Chen, X. Qian, Y. Wu, W. Zheng, and J. Ren. 2017. DudeTM: Building Durable Transactions with Decoupling for Persistent Memory. In ASPLOS.

[13]

S. Liu, A. Kolli, J. Ren, and S. M. Khan. 2018. Crash Consistency in Encrypted Non-volatile Main Memory Systems. In HPCA.

[14]

S. Liu, K. Seemakhupt, G. Pekhimenko, A. Kolli, and S. Khan. 2019. Janus: optimizing memory and storage support for non-volatile memory systems. In ISCA.

[15]

C. Mohan, D. Haderle, B. G. Lindsay, H. Pirahesh, and P. M. Schwarz. 1992. ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. ACM Trans. Database Syst. 17, 1 (1992).

Digital Library

[16]

S. Nalli, S. Haria, M. D. Hill, M. M. Swift, H. Volos, and K. Keeton. 2017. An Analysis of Persistent Memory Use with WHISPER. In ASPLOS.

[17]

S. Pelley, P. M. Chen, and T. F. Wenisch. 2014. Memory persistency. In ISCA.

[18]

M. Poremba, T. Zhang, and Y. Xie. 2015. NVMain 2.0: A User-Friendly Memory Simulator to Model (Non-)Volatile Memory Systems. IEEE Comput. Archit. Lett. 14, 2 (2015).

Digital Library

[19]

J. Rakshit and K. Mohanram. 2017. ASSURE: Authentication Scheme for SecURE Energy Efficient Non-Volatile Memories. In DAC.

Digital Library

[20]

G. Saileshwar, P. J. Nair, P. Ramrakhyani, W. Elsasser, J. A. Joao, and M. K. Qureshi. 2018. Morphable Counters: Enabling Compact Integrity Trees For Low-Overhead Secure Memories. In MICRO.

[21]

S. Swami, J. Rakshit, and K. Mohanram. 2016. SECRET: smartly EnCRypted energy efficient non-volatile memories. In DAC.

[22]

C. Yan, D. Englender, M. Prvulovic, B. Rogers, and Y. Solihin. 2006. Improving Cost, Performance, and Security of Memory Encryption and Authentication. In ISCA.

[23]

F. Yang, Y. Lu, Y. Chen, H. Mao, and J. Shu. 2019. No Compromises: Secure NVM with Crash Consistency, Write-Efficiency and High-Performance. In DAC.

Digital Library

[24]

M. Ye, C. Hughes, and A. Awad. 2018. Osiris: A Low-Cost Mechanism to Enable Restoration of Secure Non-Volatile Memories. In MICRO.

[25]

V. Young, P. J. Nair, and M. K. Qureshi. 2015. DEUCE: Write-Efficient Encryption for Non-Volatile Memories. In ASPLOS.

Digital Library

[26]

K. A. Zubair and A. Awad. 2019. Anubis: ultra-low overhead and recovery time for secure non-volatile memories. In ISCA.

[27]

P. Zuo, Y. Hua, and Y. Xie. 2019. SuperMem: Enabling Application-transparent Secure Persistent Memory with Low Overheads. In MICRO.

Cited By

Wei XFeng DTong WWu BJiang X(2025)SEED: Speculative Security Metadata Updates for Low-Latency Secure MemoryACM Transactions on Architecture and Code Optimization10.1145/3722111Online publication date: 7-Mar-2025
https://dl.acm.org/doi/10.1145/3722111
Liang WHu HZou XXia WPan Y(2023)DRPTM: A Decoupled Read-efficient High-scalable Persistent Transactional Memory2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247971(1-6)Online publication date: 9-Jul-2023
https://doi.org/10.1109/DAC56929.2023.10247971

Recommendations

Bonsai Merkle Forests: Efficiently Achieving Crash Consistency in Secure Persistent Memory
MICRO '21: MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture

Due to its durability, the security of persistent memory (PM) needs to be ensured. Recent works have identified the requirements for correctly architecting secure PM to achieve crash recoverability. A key performance bottleneck, however, lies in the ...
SpecPMT: Speculative Logging for Resolving Crash Consistency Overhead of Persistent Memory
ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2

Crash consistency overhead is a long-standing barrier to the adoption of byte-addressable persistent memory in practice. Despite continuous progress, persistent transactions for crash consistency still incur a 5.6X slowdown, making persistent memory ...
COVER: Alleviating Crash-Consistency Error Amplification in Secure Persistent Memory Systems
Data security (including confidentiality, integrity, and availability) and crash consistency guarantees are essential for building trusted persistent memory (PM) systems. Security and consistency metadata are added to enable the guarantees. Recent studies ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAC '22: Proceedings of the 59th ACM/IEEE Design Automation Conference

July 2022

1462 pages

ISBN:9781450391429

DOI:10.1145/3489517

General Chair:
Rob Oshana
NXP

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
IEEE CEDA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 August 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

National Natural Science Foundation of China (NSFC)
Ministry of Education of China

Conference

DAC '22

Sponsor:

SIGDA

DAC '22: 59th ACM/IEEE Design Automation Conference

July 10 - 14, 2022

California, San Francisco

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
183
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)4

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wei XFeng DTong WWu BJiang X(2025)SEED: Speculative Security Metadata Updates for Low-Latency Secure MemoryACM Transactions on Architecture and Code Optimization10.1145/3722111Online publication date: 7-Mar-2025
https://dl.acm.org/doi/10.1145/3722111
Liang WHu HZou XXia WPan Y(2023)DRPTM: A Decoupled Read-efficient High-scalable Persistent Transactional Memory2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247971(1-6)Online publication date: 9-Jul-2023
https://doi.org/10.1109/DAC56929.2023.10247971

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten