Whole-system persistence
Authors:
Open Access
- 3 March 2012
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 40 (1) , 401-410
Abstract
Today's databases and key-value stores commonly keep all their data in main memory. A single server can have over 100 GB of memory, and a cluster of such servers can have 10s to 100s of TB. However, a storage back end is still required for recovery from failures. Recovery can last for minutes for a single server or hours for a whole cluster, causing heavy load on the back end. Non-volatile main memory (NVRAM) technologies can help by allowing near-instantaneous recovery of in-memory state. However, today's software does not support this well. Block-based approaches such as persistent buffer caches suffer from data duplication and block transfer overheads. Recently, user-level persistent heaps have been shown to have much better performance than these. However they require substantial application modification and still have significant runtime overheads. This paper proposes whole-system persistence (WSP) as an alternative. WSP is aimed at systems where all memory is non-volatile. It transparently recovers an application's entire state, making a failure appear as a suspend/resume event. Runtime overheads are eliminated by using "flush on fail": transient state in processor registers and caches is flushed to NVRAM only on failure, using the residual energy from the system power supply. Our evaluation shows that this approach has 1.6--13 times better runtime performance than a persistent heap, and that flush-on-fail can complete safely within 2--35\% of the residual energy window provided by standard power supplies.Keywords
This publication has 16 references indexed in Scilit:
- Scalable high performance main memory system using phase-change memory technology2009
- Architecting phase change memory as a scalable dram alternative2009
- H-storeProceedings of the VLDB Endowment, 2008
- Dynamo2007
- The checkpoint mechanism in KeyKOS2003
- An orthogonally persistent JavaACM SIGMOD Record, 1996
- The Rio file cache1996
- Concurrent compacting garbage collection of a persistent heap1993
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- PS-algolACM SIGPLAN Notices, 1982