scispace - formally typeset
Proceedings ArticleDOI

Free transactions with Rio Vista

David E. Lowell, +1 more
- Vol. 31, Iss: 5, pp 92-101
Reads0
Chats0
TLDR
A system that improves transaction overhead by a factor of 2000 for working sets that fit in main memory and lowers transaction overhead to 5 μsec by using no redo log, no system calls, and only one memory-to-memory copy is presented.
Abstract
Transactions and recoverable memories are powerful mechanisms for handling failures and manipulating persistent data. Unfortunately, standard recoverable memories incur an overhead of several milliseconds per transaction. This paper presents a system that improves transaction overhead by a factor of 2000 for working sets that fit in main memory. Of this factor of 2000, a factor of 20 is due to the Rio file cache, which absorbs synchronous writes to disk without losing data during system crashes. The remaining factor of 100 is due to Vista, a 720-line, recoverable-memory library tailored for Rio. Vista lowers transaction overhead to 5 μsec by using no redo log, no system calls, and only one memory-to-memory copy. This drastic reduction in overhead leads to a overall speedup of 150-556x for benchmarks based on TPC-B and TPC-C.

read more

Citations
More filters
Proceedings ArticleDOI

Better I/O through byte-addressable, persistent memory

TL;DR: A file system and a hardware architecture that are designed around the properties of persistent, byteaddressable memory, which provides strong reliability guarantees and offers better performance than traditional file systems, even when both are run on top of byte-addressable, persistent memory.
Proceedings ArticleDOI

Mnemosyne: lightweight persistent memory

TL;DR: In tests emulating the performance characteristics of forthcoming SCMs, Mnemosyne can persist data as fast as 3 microseconds and can be up to 1400% faster than alternative persistence strategies, such as Berkeley DB or Boost serialization, that are designed for disks.
Proceedings ArticleDOI

NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories

TL;DR: A lightweight, high-performance persistent object system called NV-heaps is implemented that provides transactional semantics while preventing these errors and providing a model for persistence that is easy to use and reason about.
Journal ArticleDOI

The case for RAMClouds: scalable high-performance storage entirely in DRAM

TL;DR: This paper argues for a new approach to datacenter storage called RAMCloud, where information is kept entirely in DRAM and large-scale systems are created by aggregating the main memories of thousands of commodity servers.

Recovery Oriented Computing (ROC): Motivation, Definition, Techniques, and Case Studies

TL;DR: Recovery Oriented Computing (ROC) takes the perspective that hardware faults, software bugs, and operator errors are facts to be coped with, not problems to be solved, and thus offers higher availability.
References
More filters
Book

Transaction Processing: Concepts and Techniques

Jim Gray, +1 more
TL;DR: Using transactions as a unifying conceptual framework, the authors show how to build high-performance distributed systems and high-availability applications with finite budgets and risk.
Book ChapterDOI

Notes on Data Base Operating Systems

Jim Gray
TL;DR: This paper is a compendium of data base management operating systems folklore and focuses on particular issues unique to the transaction management component especially locking and recovery.
Proceedings ArticleDOI

Efficient software-based fault isolation

TL;DR: It is demonstrated that for frequently communicating modules, implementing fault isolation in software rather than hardware can substantially improve end-to-end application performance.
Journal ArticleDOI

Principles of transaction-oriented database recovery

TL;DR: A terminological framework is provided for describing different transactionoriented recovery schemes for database systems in a conceptual rather than an implementation-dependent way by introducing the terms materialized database, propagation strategy, and checkpoint, and a means for classifying arbitrary implementations from a unified viewpoint.
Proceedings ArticleDOI

Implementation techniques for main memory database systems

TL;DR: This paper considers the changes necessary to permit a relational database system to take advantage of large amounts of main memory, and evaluates AVL vs B+-tree access methods, hash-based query processing strategies vs sort-merge, and study recovery issues when most or all of the database fits in main memory.
Related Papers (5)