Affiliation:
1. University of California, San Diego, San Diego, CA, USA
Abstract
Persistent, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted their design and limited their performance. Fast, byte-addressable, non-volatile technologies, such as phase change memory, will remove this constraint and allow programmers to build high-performance, persistent data structures in non-volatile storage that is almost as fast as DRAM. Creating these data structures requires a system that is lightweight enough to expose the performance of the underlying memories but also ensures safety in the presence of application and system failures by avoiding familiar bugs such as dangling pointers, multiple free()s, and locking errors. In addition, the system must prevent new types of hard-to-find pointer safety bugs that only arise with persistent objects. These bugs are especially dangerous since any corruption they cause will be permanent.
We have implemented a lightweight, high-performance persistent object system called NV-heaps that provides transactional semantics while preventing these errors and providing a model for persistence that is easy to use and reason about. We implement search trees, hash tables, sparse graphs, and arrays using NV-heaps, BerkeleyDB, and Stasis. Our results show that NV-heap performance scales with thread count and that data structures implemented using NV-heaps out-perform BerkeleyDB and Stasis implementations by 32x and 244x, respectively, by avoiding the operating system and minimizing other software overheads. We also quantify the cost of enforcing the safety guarantees that NV-heaps provide and measure the costs of NV-heap primitive operations.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference62 articles.
1. B. Aker. Libmemcached. http://libmemcached.org/. B. Aker. Libmemcached. http://libmemcached.org/.
2. P. Allenbach. Java card 3: Classic functionality gets a connectivity boost March 2009. http://java.sun.com/developer/technicalArticles/javacard/javacard3/. P. Allenbach. Java card 3: Classic functionality gets a connectivity boost March 2009. http://java.sun.com/developer/technicalArticles/javacard/javacard3/.
3. Combining language and database advances in an object-oriented development environment
4. An orthogonally persistent Java
5. Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Dalea: A Persistent Multi-Level Extendible Hashing with Improved Tail Performance;Journal of Computer Science and Technology;2023-09
2. Progress on storage systems for disaggregated data centers;SCIENTIA SINICA Informationis;2023-08-01
3. TL4x;Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2023-02-21
4. The past, present and future of indexing on persistent memory;Proceedings of the VLDB Endowment;2022-08
5. Zen+: a robust NUMA-aware OLTP engine optimized for non-volatile main memory;The VLDB Journal;2022-04-06