201. Speedy transactions in multicore in-memory databases
- Author
-
Stephen Tu, Wenting Zheng, Samuel Madden, Eddie Kohler, Barbara Liskov, delete, Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Tu, Stephen, Zheng, Wenting, Liskov, Barbara H., and Madden, Samuel R.
- Subjects
Multi-core processor ,Database ,Serializability ,Computer science ,Silo ,Scalability ,Operating system ,Commit ,computer.software_genre ,Database transaction ,Optimistic concurrency control ,computer ,Transactions per second - 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., National Science Foundation (U.S.) (Grant 1065219), National Science Foundation (U.S.) (Grant 0704424)
- Published
- 2013