Filters








28,962 Hits in 5.5 sec

Data Structure Primitives on Persistent Memory: An Evaluation [article]

Philipp Götze, Arun Kumar Tharanatha, Kai-Uwe Sattler
2020 arXiv   pre-print
Persistent Memory (PMem), as already available, e.g., with Intel Optane DC Persistent Memory, represents a very promising, next-generation memory solution with a significant impact on database architectures  ...  Several data structures for this new technology and its properties have already been proposed. However, primarily only complete structures are presented and evaluated.  ...  The former approach could result in a performance benefit when the Data Structure Primitives on Persistent Memory: An Evaluation , , inserted keys are unique, whereas the latter approach could be a better  ... 
arXiv:2001.02172v2 fatcat:6k3awgea7zbczdcbwbzih6xu2a

Persistent Memory I/O Primitives [article]

Alexander van Renen, Lukas Vogel, Viktor Leis, Thomas Neumann, Alfons Kemper
2019 arXiv   pre-print
Upcoming persistent memory (PMem) technologies, like Intel's Optane DC Persistent Memory Modules, promise to bridge the gap between NAND-based flash (SSD) and DRAM, and thus eliminate the I/O bottleneck  ...  In this paper, we provide one of the first performance evaluations of PMem in terms of bandwidth and latency.  ...  This implies that any persistent data structure on PMem always needs to be in a consistent state, otherwise, a system crash-interrupting an update operation-could lead to an inconsistent state after a  ... 
arXiv:1904.01614v3 fatcat:k6lu65ah2ff2ld727xjy2wg224

Memory Persistency: Semantics for Byte-Addressable Nonvolatile Memory Technologies

Steven Pelley, Peter M. Chen, Thomas F. Wenisch
2015 IEEE Micro  
We thank Aasheesh Kolli for assistance in formalizing our descriptions of persistency models and Ali Saidi for feedback on this work.  ...  In either scenario, the correctness of recoverable data structures relies on knowing the order of durable writes.  ...  Such a design allows synchronization primitives and other complex, concurrent volatile data structures to be written with the simpler programming interface of strong consistency, while allowing greater  ... 
doi:10.1109/mm.2015.46 fatcat:3ffdrwriobecdny5nbwwhnr2yu

Observations on Porting In-memory KV stores to Persistent Memory [article]

Brian Choi, Parv Saxena, Ryan Huang, Randal Burns
2020 arXiv   pre-print
We implement persistent memory support in Redis and Memcached, adapting the data structures of each to work in two modes: (1) with all data in persistent memory and (2) a hybrid mode that uses persistent  ...  memory for key/value data and non-volatile memory for indexing and metadata.  ...  Without relying on a persistent memory library, developers will have to manually create their own persistent data storage method or structure.  ... 
arXiv:2002.02017v1 fatcat:rdy63vvsj5duvplrnywyotzroi

The CAP project - an interim evaluation

R. M. Needham
1977 Proceedings of the sixth symposium on Operating systems principles - SOSP '77  
The CAP project has included the design and construction of a computer with an unusual and very detailed structure of memory protection, and subsequently the development of an operating system which fully  ...  The project was started as an experiment in hardware memory protection.  ... 
doi:10.1145/800214.806543 dblp:conf/sosp/Needham77 fatcat:6thdenuygbfshohdezj2h4zh7e

A Secure and Persistent Memory System for Non-volatile Memory [article]

Pengfei Zuo, Yu Hua, Yuan Xie
2019 arXiv   pre-print
In the non-volatile memory, ensuring the security and correctness of persistent data is fundamental. However, the security and persistence issues are usually studied independently in existing work.  ...  To achieve both data security and persistence, simply combining existing persistence schemes with memory encryption is inefficient due to crash inconsistency and significant performance degradation.  ...  If a system failure occurs when a data structure in NVM is being updated, the data structure may be left in a corrupted state.  ... 
arXiv:1901.00620v1 fatcat:3fgqd5afifdyzmlrybfaxanj3y

Memory persistency

Steven Pelley, Peter M. Chen, Thomas F. Wenisch
2014 2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA)  
We introduce memory persistency, a new approach to designing persistent memory interfaces, building on memory consistency.  ...  We require new memory interfaces to minimally describe write constraints and allow high performance and high concurrency data structures. These goals strongly resemble memory consistency.  ...  Sufficiently relaxed persistency models allow data structures and systems that recover from failure while retaining the throughput of existing main-memory data structures. Persist Latency.  ... 
doi:10.1109/isca.2014.6853222 dblp:conf/isca/PelleyCW14 fatcat:n7b4ux3hr5bkzbq5gkkaxqmyzq

Memory persistency

Steven Pelley, Peter M. Chen, Thomas F. Wenisch
2014 SIGARCH Computer Architecture News  
We introduce memory persistency, a new approach to designing persistent memory interfaces, building on memory consistency.  ...  We require new memory interfaces to minimally describe write constraints and allow high performance and high concurrency data structures. These goals strongly resemble memory consistency.  ...  Sufficiently relaxed persistency models allow data structures and systems that recover from failure while retaining the throughput of existing main-memory data structures. Persist Latency.  ... 
doi:10.1145/2678373.2665712 fatcat:6f5rrbr5mzda7cxjktkrvyzzri

Persistent Memory Programming Abstractions in Context of Concurrent Applications [article]

Ajay Singh, Marc Shapiro, Gael Thomas
2017 arXiv   pre-print
Eventually, we evaluate the performance of the set and hash-table data structure applications.  ...  We study the NVthreads, Mnemosyne and NVML libraries by building a concurrent and persistent set and open addressed hash-table data structure application.  ...  transaction::exec tx: uses c++ lambda expression to perform in-place updates of data structures into the NVM. 4) delete persistent: to delete an allocation from persistent region.  ... 
arXiv:1712.04989v1 fatcat:yeizaf2e4jh6vghmppa4rk7yai

Persistent Memory Transactions [article]

Virendra Marathe, Achin Mishra, Amee Trivedi, Yihe Huang, Faisal Zaghloul, Sanidhya Kashyap, Margo Seltzer, Tim Harris, Steve Byan, Bill Bridge, Dave Dice
2018 arXiv   pre-print
workloads, size of the persistence domain (portion of the memory hierarchy where the data is effectively persistent), cache locality, and transaction runtime bookkeeping overheads.  ...  This paper presents a comprehensive analysis of performance trade offs between implementation choices for transaction runtime systems on persistent memory.  ...  loads and stores to arbitrary data structures hosted in persistent memory.  ... 
arXiv:1804.00701v1 fatcat:3lfj7ldnb5gxpaj6ha5b7ljulm

Evaluating persistent memory range indexes

Lucas Lersch, Xiangpeng Hao, Ismail Oukid, Tianzheng Wang, Thomas Willhalm
2019 Proceedings of the VLDB Endowment  
Persistent memory (PM) is fundamentally changing the way database index structures are built by enabling persistence, high performance, and (near) instant recovery all on the memory bus.  ...  With the recent released Intel Optane DC Persistent Memory, for the first time, this paper provides a comprehensive evaluation of recent persistent index structures.  ...  Programming Persistent Memory The use of PM introduces new challenges in data persistence, memory management and concurrency.  ... 
doi:10.14778/3372716.3372728 fatcat:vu5pnm7umbelnf36rrmw4t3yii

Persisting in-memory databases using SCM

Ellis Giles, Kshitij Doshi, Peter Varman
2016 2016 IEEE International Conference on Big Data (Big Data)  
In this paper, we present various methods to achieve highperformance byte-addressable persistence for an in-memory data store.  ...  We modified its source code to use SCM such that updates to data and structures are performed in a failure resilient manner. We evaluated the changes using both internal benchmarks and the Yahoo!  ...  Storage Class Memory will allow an in-memory data structure store such as Redis to operate directly in persistent memory, without having to check-point operations and serialize the disk data.  ... 
doi:10.1109/bigdata.2016.7840950 dblp:conf/bigdataconf/GilesDV16 fatcat:27jlwwi7zffubj5cbe4isgqwti

System software for persistent memory

Subramanya R. Dulloor, Sanjay Kumar, Anil Keshavamurthy, Philip Lantz, Dheeraj Reddy, Rajesh Sankaran, Jeff Jackson
2014 Proceedings of the Ninth European Conference on Computer Systems - EuroSys '14  
However, such load/store accessible Persistent Memory (PM) has implications on system design, both hardware and software.  ...  Emerging byte-addressable, non-volatile memory technologies offer performance within an order of magnitude of DRAM, prompting their inclusion in the processor memory subsystem.  ...  We refer to such memory as Persistent Memory (PM) . PM has implications on system architecture, system software, libraries, and applications [26, 27, 36, 40] .  ... 
doi:10.1145/2592798.2592814 dblp:conf/eurosys/RaoKKLRSJ14 fatcat:6nf6e57l4fbcxcdt2ozr7vhpom

STUDY OF MEMORY ORGANIZATION AND MULTIPROCESSOR SYSTEM -USING THE CONCEPT OF DISTRIBUTED SHARED MEMORY, MEMORY CONSISTENCY MODEL AND SOFTWARE BASED DSM

Dhara Kumari
2017 International Journal of Advanced Research in Computer Science  
This paper provides an almost exhaustive survey of the existing problem and solutions in a uniform manner, presenting their memory organization, shared memory, distributed memory, distributed shared memory  ...  To improve the performance and efficiency of that multiprocessor system and memory organization, we can use different type of techniques that is based on the concept and implementation of Hardware, Software  ...  .  Review of performance evaluation and analysis Performance evaluation of distributed shared memory systems (both hardware and software approaches) is not an easy task.  ... 
doi:10.26483/ijarcs.v8i7.4406 fatcat:kjr35sorg5enxnztn3kj6kmzy4

Object swapping challenges: An evaluation of imageSegment

Mariano Martinez Peck, Noury Bouraqadi, Stéphane Ducasse, Luc Fabresse
2012 Computer languages, systems & structures  
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running.  ...  Swapping refers to moving the graph to a secondary memory (e.g., a hard disk) to temporary release part of the primary memory (e.g., RAM).  ...  By trashing we refer to the situation where data is rapidly written to and read from different types of memory, i.e., constant data swapping.  ... 
doi:10.1016/j.cl.2011.10.001 fatcat:7fjmzc3umrfmblbxtuy4lrlx5a
« Previous Showing results 1 — 15 out of 28,962 results