Low-Overhead Asynchronous Checkpointing in Main-Memory Database Systems
Low-Overhead Asynchronous Checkpointing in Main-Memory Database Systems
复制标题
DOI：
10.1145/2882903.2915966
复制
发表时间：
2016-06
期刊：
影响因子：
--
通讯作者：
Kun Ren;Thaddeus Diamond;D. Abadi;Alexander Thomson
中科院分区：
文献类型：
--
作者：
Kun Ren;Thaddeus Diamond;D. Abadi;Alexander Thomson
随着事务处理系统越来越普遍地在适合于单个机器或商品机器集群的主存储器内的数据集上操作，用于保证事务持久性的传统机制---通常涉及同步日志刷新---对否则轻量级事务产生越来越不吸引人的成本。许多应用程序已经转向周期性地检查完整数据库状态。然而，现有的检查点方法-即使是那些避免冻结存储层的方法-通常会在操作吞吐量、端到端延迟和总内存使用方面带来显着的成本。本文介绍了异步检查点使用逻辑一致性（CALC），一个轻量级的，异步的技术，捕捉数据库快照，不需要一个物理点的一致性来创建一个检查点，并避免了其他数据库快照计划引起的显着的延迟尖峰。我们的实验表明，CALC可以捕获频繁的检查点在各种事务性工作负载的成本极小的事务性吞吐量和低额外的内存使用相比，其他国家的最先进的检查点系统。
As it becomes increasingly common for transaction processing systems to operate on datasets that fit within the main memory of a single machine or a cluster of commodity machines, traditional mechanisms for guaranteeing transaction durability---which typically involve synchronous log flushes---incur increasingly unappealing costs to otherwise lightweight transactions. Many applications have turned to periodically checkpointing full database state. However, existing checkpointing methods---even those which avoid freezing the storage layer---often come with significant costs to operation throughput, end-to-end latency, and total memory usage. This paper presents Checkpointing Asynchronously using Logical Consistency (CALC), a lightweight, asynchronous technique for capturing database snapshots that does not require a physical point of consistency to create a checkpoint, and avoids conspicuous latency spikes incurred by other database snapshotting schemes. Our experiments show that CALC can capture frequent checkpoints across a variety of transactional workloads with extremely small cost to transactional throughput and low additional memory usage compared to other state-of-the-art checkpointing systems.