SIREN: A Memory-Conserving, Snapshot-Consistent Checkpoint Algorithm for in-Memory Databases

Liedes, A.-P.; Wolski, Antoni

doi:10.1109/icde.2006.140

Cited by 24 publications

(23 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, use of an atomic object size smaller than a disk sector adds significant overheads, especially for double-backup schemes. Techniques to improve I/O by organizing objects into logical pages are orthogonal to our description [18]. We assume they have been applied in order to make the atomic object size equal to a disk sector.…”

Section: Methodsmentioning

confidence: 99%

“…We use a double-backup structure on disk as in Atomic-Copy-Dirty-Objects. A similar method was used in SIREN, where the authors found that it may be beneficial to copy at the tuple level rather than the page level [18]. In our experiments, all copies are performed at the level of atomic objects whose size may be configured (Section 4.1).…”

Section: Consistent Checkpointing Techniquesmentioning

confidence: 99%

“…We consider a principled approach to durability using a checkpoint recovery approach first proposed for main-memory databases [18,39,29] and scientific simulations [30]. The applicability of these approaches to MMOs has never been fully explored, and our investigation focuses on the unique workload requirements found in online games.…”

Section: Recovery Requirements For Mmosmentioning

confidence: 99%

“…In this paper we experimentally evaluate a number of traditional main-memory checkpoint recovery strategies for use with MMOs [18,29,39]. These strategies advocate using logical logging to reduce disk activity and periodically creating consistent checkpoints of the main-memory state.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An evaluation of checkpoint recovery for massively multiplayer online games

et al. 2009

View full text Add to dashboard Cite

Massively multiplayer online games (MMOs) have emerged as an exciting new class of applications for database technology. MMOs simulate long-lived, interactive virtual worlds, which proceed by applying updates in frames or ticks, typically at 30 or 60 Hz. In order to sustain the resulting high update rates of such games, game state is kept entirely in main memory by the game servers. Nevertheless, durability in MMOs is usually achieved by a standard DBMS implementing ARIES-style recovery. This architecture limits scalability, forcing MMO developers to either invest in high-end hardware or to over-partition their virtual worlds.In this paper, we evaluate the applicability of existing checkpoint recovery techniques developed for main-memory DBMS to MMO workloads. Our thorough experimental evaluation uses a detailed simulation model fed with update traces generated synthetically and from a prototype game server. Based on our results, we recommend MMO developers to adopt a copy-on-update scheme with a double-backup disk organization to checkpoint game state. This scheme outperforms alternatives in terms of the latency introduced in the game as well the time necessary to recover after a crash.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Consistent Checkpointing Techniquesmentioning

confidence: 99%

Section: Recovery Requirements For Mmosmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An evaluation of checkpoint recovery for massively multiplayer online games

et al. 2009

View full text Add to dashboard Cite

show abstract

“…MMDBMSs use optimizations to structure and organize data. Because of the volatile characteristics of the main memory, reliability on MMDBMS has been one of the main concerns in the area and a lot of work has been done concerning the recovery, logging and checkpointing of such systems [5]. The interest on MMDBMS has increased [6] and many commercial MMDBMSs have been developed.…”

Section: Related Workmentioning

confidence: 99%

Hybrid In-Memory and On-Disk Tables for Speeding-Up Table Accesses

Guisado-Gámez

Wolski

Zuzarte

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Main memory database management systems have become essential for response-time-bounded applications, such as those in telecommunications systems or Internet, where users frequently access a table in order to get information or check whether an element exists, and require the response to be as fast as possible. Continuous data growth is making it unaffordable to keep entire relations in memory and some commercial applications provide two different engines to handle data inmemory and on-disk separately. However, these systems assign each table to one of these engines, forcing large relations to be kept on secondary storage.In this paper we present TwinS -a hybrid database management system that allows managing hybrid tables, i.e. tables partially managed by both engines. We show that we can reduce response time when accessing a large table in the database. All our experiments have been run on a dual-engine DBMS: IBM R SolidDB R .

show abstract

Efficient checkpointing mechanisms for primary‐backup replication on the cloud

Guler

Özkasap

2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary Several distributed services ranging from key‐value stores to cloud storage require fault‐tolerance and reliability features. For enabling fast recovery and seamless transition, primary‐backup replication protocols are widely used in different application settings including distributed databases, web services, and the Internet of Things. In this study, we elaborate the ways of enhancing the efficiency of the primary‐backup replication protocol by introducing various checkpointing techniques. We develop a geographically replicated key‐value store based on the RocksDB and use the PlanetLab testbed network for large‐scale performance analysis. Using various metrics of interest including blocking time, checkpointing time, checkpoint size, failover time, and throughput and testing with practical workloads via the YCSB tool, our findings indicate that periodic‐incremental checkpointing promises up to 5 times decrease in blocking time and a drastic improvement on the overall throughput compared to the traditional primary‐backup replication. Furthermore, enabling Snappy compression algorithm on the periodic‐incremental checkpointing leads to further reduction in blocking time and increases system throughput compared to the traditional primary‐backup replication.

show abstract

SIREN: A Memory-Conserving, Snapshot-Consistent Checkpoint Algorithm for in-Memory Databases

Cited by 24 publications

References 9 publications

An evaluation of checkpoint recovery for massively multiplayer online games

An evaluation of checkpoint recovery for massively multiplayer online games

Hybrid In-Memory and On-Disk Tables for Speeding-Up Table Accesses

Efficient checkpointing mechanisms for primary‐backup replication on the cloud

Contact Info

Product

Resources

About