Fast Databases with Fast Durability and Recovery Through Multicore Parallelism
MetadataShow full item record
CitationZheng, Wenting, Stephen Tu, Eddie Kohler, and Barbara Liskov. 2014. "Fast Databases With Fast Durability and Recovery Through Multicore Parallelism." In Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI '14), Broomfield, CO, October 6-8, 2014: 465-477.
AbstractMulticore in-memory databases for modern machines can support extraordinarily high transaction rates for online transaction processing workloads. A potential weakness, however, is recovery from crash failures. Can classical techniques, such as checkpoints, be made both efficient enough to keep up with current systems’ memory sizes and transaction rates, and smart enough to avoid additional contention? Starting from an efficient multicore database system, we show that naive logging and checkpoints make normal-case execution slower, but that frequent disk synchronization allows us to keep up with many workloads with only a modest reduction in throughput. We design throughout for parallelism: during logging, during checkpointing, and during recovery. The result is fast. Given appropriate hardware (three SSDs and a RAID), a 32-core system can recover a 43.2 GB key-value database in 106 seconds, and a > 70 GB TPC-C database in 211 seconds.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:22719033
- FAS Scholarly Articles