Speedy transactions in multicore in-memory databases
Name
Liskov_Speedy transactions.pdf
Size
574.27 KB
Format
Adobe PDF
Checksum (MD5)
bc97bc3ebf94b591c68ee35c6ae53db3
Author(s)
Tu, Stephen
Zheng, Wenting
Kohler, Eddie
Liskov, Barbara H.
Madden, Samuel R.
Date Issued
November 2013
Journal
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP '13)
Publisher
Association for Computing Machinery (ACM)
Citation
Stephen Tu, Wenting Zheng, Eddie Kohler, Barbara Liskov, and Samuel Madden. 2013. Speedy transactions in multicore in-memory databases. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP '13). ACM, New York, NY, USA, 18-32.
Version
Author's final manuscript
Abstract
Silo is a new in-memory database that achieves excellent performance and scalability on modern multicore machines. Silo was designed from the ground up to use system memory and caches efficiently. For instance, it avoids all centralized contention points, including that of centralized transaction ID assignment. Silo's key contribution is a commit protocol based on optimistic concurrency control that provides serializability while avoiding all shared-memory writes for records that were only read. Though this might seem to complicate the enforcement of a serial order, correct logging and recovery is provided by linking periodically-updated epochs with the commit protocol. Silo provides the same guarantees as any serializable database without unnecessary scalability bottlenecks or much additional latency. Silo achieves almost 700,000 transactions per second on a standard TPC-C workload mix on a 32-core machine, as well as near-linear scalability. Considered per core, this is several times higher than previously reported results.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2517349.2522713
