Snapshotting Mechanisms for Persistent Memory-Mapped Files-Reference-Cited by-同舟云学术

Snapshotting Mechanisms for Persistent Memory-Mapped Files

Published:2024-06-17 Issue: Volume:101 Page:1-9
ISSN:
Container-title:Proceedings of the 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems
language:
Short-container-title:

Author:

Moridi Mohammad¹^ORCID,Golab Wojciech¹^ORCID

Affiliation:

1. Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada

Funder

Natural Sciences and Engineering Research Council of Canada

Ontario Early Researcher Award

Google Faculty Research Award

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3663338.3665832

Reference41 articles.

1. Understanding and optimizing persistent memory allocation

2. Wentao Cai, Haosen Wen, Vladimir Maksimovski, Mingzhe Du, Rafaello Sanna, Shreif Abdallah, and Michael L. Scott. 2021. Fast Nonblocking Persistence for Concurrent Data Structures. In Proc. of the 35th International Symposium on Distributed Computing (DISC). 14:1--14:20.

3. Wentao Cai, Haosen Wen, and Michael L. Scott. 2023. Transactional Composition of Nonblocking Data Structures. In Proc. of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP). 441--443.

4. T. Cao, M.A.V. Salles, B. Sowell, Y. Yue, A.J. Demers, J. Gehrke, and W.M. White. 2011. Fast checkpoint recovery algorithms for frequently consistent applications. In Proc. ACM SIGMOD Int. Conf. Manage. Data (SIGMOD). 265--276.

5. Dhruva R Chakrabarti, Hans-J Boehm, and Kumud Bhandari. 2014. Atlas: Leveraging locks for non-volatile memory consistency. In Proc. of the ACM Conference on Object-Oriented Programming Systems Languages and Applications (OOPSLA). 433--452.