Filters








16,663 Hits in 4.1 sec

PMDK Internals: Important Algorithms and Data Structures [chapter]

Steve Scargall
2020 Programming Persistent Memory  
Chapters 5 through 10 describe most of the libraries contained within the Persistent Memory Development Kit (PMDK) and how to use them.  ...  This chapter introduces the fundamental algorithms and data structures on which libpmemobj is built.  ...  ACID Transactions: Efficient Low-Level Persistent Transactions The four components we just described -lanes, redo logs, undo logs, and the transactional memory allocator -form the basis of libpmemobj's  ... 
doi:10.1007/978-1-4842-4932-1_16 fatcat:d3zk253uzrhehm36q2rv4v5kli

TMOS: A Transactional Garbage Collector [chapter]

John Zigman, Stephen M. Blackburn, J. Eliot B. Moss
2001 Lecture Notes in Computer Science  
TMOS represents the application of the Mature Object Space family of GC algorithms to the transactional context through our approach to transactional GC design.  ...  Our design approach brings together three independent components-a mutator, a transactional store, and a GC algorithm.  ...  An Approach to Transactional GC In this section we present a framework and methodology for the design of garbage collection algorithms for transactional persistent stores.  ... 
doi:10.1007/3-540-45498-5_12 fatcat:s237w7wdfrf6vp6kunfak6oalu

Crafty: Efficient, HTM-Compatible Persistent Transactions [article]

Kaan Genç Ohio State University
2020 arXiv   pre-print
This paper introduces Crafty, a new approach for ensuring consistency and atomicity on persistent memory operations using commodity hardware with existing hardware transactional memory (HTM) capabilities  ...  Byte-addressable persistent memory, such as Intel/Micron 3D XPoint, is an emerging technology that bridges the gap between volatile memory and persistent storage.  ...  Thanks to Steve Blackburn, Jake Roemer, and Tomoharu Ugawa for helpful discussions and feedback.  ... 
arXiv:2004.00262v1 fatcat:kwgly52fmnerdgfcghgzgnrc24

Transaction local aliasing in storage class memory

Ellis Giles, Kshitij Doshi, Peter Varman
2015 2015 IEEE International Conference on Networking, Architecture and Storage (NAS)  
Analysis of consistency models for persistent memory was considered in [5] .  ...  An early presentation of SoftWrAP technique [4] was introduced in [3] , and a similar approach for supporting transactional writes to persistent memory is described in REWIND [2] , which offers a more  ... 
doi:10.1109/nas.2015.7255242 dblp:conf/nas/GilesDV15 fatcat:wgejqzvroveyvcq3yfj2wsuozq

Later Validation/Earlier Write: Concurrency Control for Resource-Constrained Systems with Real-Time Properties

Kamal Solaiman, Graham Morgan
2011 2011 IEEE 30th Symposium on Reliable Distributed Systems Workshops  
We describe an algorithm for optimistic concurrency control suitable for governing transactions operating on databases residing on resource constraint devices.  ...  We attempt to improve energy efficiency by reducing persistent store access and satisfy real-time requirements via transaction scheduling that affords greater determinism.  ...  ACKNOWLEDGMENT We would like to thank Fahren Bukhari for his insightful discussions regarding the development of this algorithm.  ... 
doi:10.1109/srdsw.2011.11 dblp:conf/srds/SolaimanM11 fatcat:hjsutimvmjfefhhktcmsqilmmi

Designing persistence for real-time distributed object systems [chapter]

Igor Nekrestyanov, Boris Novikov, Ekaterina Pavlova
1998 Lecture Notes in Computer Science  
An implementation of persistent object store for real-time systems with strict processing time constraints is a challenging task, because many traditional database techniques, e.g. transaction management  ...  The major contributions are: use of distributed dynamic hashing to achieve load balancing and tight coupling of transaction and virtual memory management, which allows local scheduling of read-only transactions  ...  The Performance Model Proposed concurrency control algorithm has little overhead, but may potentially result in high rate of transaction aborts (typical for all optimistic algorithms).  ... 
doi:10.1007/bfb0057737 fatcat:ypimglsilnh6nplhhns4ugtf2e

TxCache: Transactional cache using byte-addressable non-volatile memories in SSDs

Youyou Lu, Jiwu Shu, Peng Zhu
2014 2014 IEEE Non-Volatile Memory Systems and Applications Symposium (NVMSA)  
Transaction is a common technique to ensure system consistency but incurs high overhead. Recent flash memory techniques enable efficient embedded transaction support inside solid state drives (SSDs).  ...  In this paper, we propose a new embedded transaction mechanism, TxCache, for SSDs with non-volatile disk cache.  ...  First, disk cache size is not as large as main memory, and it might not be able to hold large transactions. Second, cache algorithms in disk cache are different from CPU cache algorithms.  ... 
doi:10.1109/nvmsa.2014.6927193 dblp:conf/nvmsa/LuSZ14 fatcat:ghh5okkssvctre6ocmhvsc2abi

FineLine

Caetano Sauer, Goetz Graefe, Theo Härder
2018 Proceedings of the VLDB Endowment  
This approach not only provides more efficient recovery with less overhead, but also decouples the management of persistent data from in-memory access paths.  ...  This paper proposes a novel approach for transactional storage and recovery called FineLine.  ...  Acknowledgements We are grateful to Viktor Leis for his valuable feedback and insightful suggestions and to Lucas Lersch for being available to bounce off ideas in many informal discussions.  ... 
doi:10.14778/3275366.3284969 fatcat:vy252p45y5br3cqmk7u5pwjtnm

Avoiding disruptive failovers in transaction processing systems with multiple active nodes

Gong Su, Arun Iyengar
2013 Journal of Parallel and Distributed Computing  
The efficient implementation of our algorithm for ordering transactions is a critically important factor in achieving good performance.  ...  Nodes agree on a total ordering for processing requests with a novel low overhead wait-free algorithm that utilizes a small amount of shared memory accessible to the nodes and a simple compare-and-swap  ...  Average latencies for handling transactions are well below 10 ms. The efficient total ordering algorithm is a critically important factor in achieving this performance.  ... 
doi:10.1016/j.jpdc.2013.01.007 fatcat:bns6gc6rzbbjpmeuv44vw2lgye

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  ...  Based on the results, we develop guidelines for efficient PMem usage and two essential I/O primitives tuned for PMem: log writing and block flushing.  ...  We highlight the impact of the physical properties of PMem on software and derive guidelines for efficient usage of PMem. • We introduce an algorithm for persisting small data chunks (transactional log  ... 
arXiv:1904.01614v3 fatcat:k6lu65ah2ff2ld727xjy2wg224

Concurrent compacting garbage collection of a persistent heap

James O'Toole, Scott Nettles, David Gifford
1993 Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93  
We describe a replicating garbage collector for a persistent heap. The garbage collector cooperates with a transaction manager to provide safe and efficient transactional storage management.  ...  The results suggest that replicating garbage collection offers a flexible and efficient way to provide automatic storage management in transaction systems, object-oriented databases and persistent programming  ...  Special thanks goes to Hank Mashburn for his implementation of Recoverable Virtual Memory, to Jeannette Wing for serving as our shepherd, and to Forest Baskett for providing us with SGI processor boards  ... 
doi:10.1145/168619.168632 dblp:conf/sosp/OTooleNG93 fatcat:v5usd3unqvesde7eaexq76ojr4

Association rule mining algorithm based on Spark for pesticide transaction data analyses

Xiaoning Bai, 1. College of Information and Electrical Engineering, China Agricultural University, Beijing 100083, China, Jingdun Jia, Qiwen Wei, Shuaiqi Huang, Weicheng Du, Wanlin Gao, 2. Institute for the Control of Agrochemicals, Ministry of Agriculture and Rural Affairs, Beijing 100125, China, 3. Ministry of Science and Technology Torch Center, Beijing 100045, China, 4. National Agricultural Technology Promotion Center, Beijing 100125, China, 5. Information Center, Ministry of Agriculture and Rural Affairs, Beijing 100125, China
2019 International Journal of Agricultural and Biological Engineering  
The Apriori algorithm is one of the classic algorithms in association rule mining, but it needs to traverse the transaction database multiple times, which will cause an extra IO burden.  ...  Spark is an emerging big data parallel computing framework with advantages such as memory computing and flexible distributed data sets.  ...  The effect of persist operation is to cache the RDD to memory of the computing node. So, persist operation provides more inefficient procession in reuse data.  ... 
doi:10.25165/j.ijabe.20191205.4881 fatcat:aqay267vfveytjs3f3cu7uqjoa

Efficient logging in non-volatile memory by exploiting coherency protocols

Nachshon Cohen, Michal Friedman, James R. Larus
2017 Proceedings of the ACM on Programming Languages  
We show how to extend the logging protocol to building a persistent set (hash map) that also requires only a single round trip to non-volatile memory for insertion, updating, or deletion.  ...  Writes to NVM, however, pass through a processor's memory system, which can delay and reorder them and can impair the correctness and cost of logging algorithms.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers of OOPSLA for their help on improving the paper and particularly Section 2 and Section 4.  ... 
doi:10.1145/3133891 dblp:journals/pacmpl/CohenFL17 fatcat:a5ow6m2le5g6fcqbxdndlaq53u

Crash recovery for real-time main memory database systems

Jing Huang, Le Gruenwald
1996 Proceedings of the 1996 ACM symposium on Applied Computing - SAC '96  
In this paper we propose an update-frequency partition checkpoint scheme and a partition reload algorithm for real-time main memory databases (MMDB) which aim at not only reducing system recovery time,  ...  The partition reload algorithm allows the system to be brought up only when high access frequency partitions are reloaded into main memory and recovered.  ...  Percent of Transactions Missing Deadlines (Reload Algorithm) 1 . 1 Partition persistent data and temporal data based on their update frequencies. 2.  ... 
doi:10.1145/331119.331166 dblp:conf/sac/HuangG96 fatcat:cfaio3e6efhxzcvy3ru2lpz54e

Recovery for real-time main memory database systems

Stéphane Guella, Le Gruenwald
1994 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications meeting the challenge of complexity in real-world computing applications - CSC '94  
In this paper we propose an update-frequency partition checkpoint scheme and a partition reload algorithm for real-time main memory databases (MMDB) which aim at not only reducing system recovery time,  ...  The partition reload algorithm allows the system to be brought up only when high access frequency partitions are reloaded into main memory and recovered.  ...  Percent of Transactions Missing Deadlines (Reload Algorithm) 1 . 1 Partition persistent data and temporal data based on their update frequencies. 2.  ... 
doi:10.1145/197530.197638 dblp:conf/acm/GuellaG94 fatcat:cqkx2tuzdrd5bhibemvxh52f7m
« Previous Showing results 1 — 15 out of 16,663 results