Abstract
Conventional non-preemptive scheduling strategies struggle to meet the latency requirements of mixed workloads: low-priority, long-running analytics can dominate CPU cores while short, highpriority transactions wait a long time to be scheduled. Although preemptive scheduling appears to be a natural solution, it has long been discouraged in DBMSs by conventional wisdom due to concerns about deadlocks and interrupt-handling overheads. In this demonstration, we highlight that this is no longer the case with PreemptDB, a modern memory-optimized DBMS that we built around (1) optimistic concurrency and (2) userspace interrupts that recently became available in x86 CPUs. PreemptDB proposes user-interruptassisted context switching to renew preemptive scheduling in modern DBMSs. Through a set of demonstration scenarios, we show that preemptive scheduling is practical and prioritizes high-priority transactions while preserving throughput and fairness.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 5299-5302 |
| Number of pages | 4 |
| Journal | Proceedings of the VLDB Endowment |
| Volume | 18 |
| Issue number | 12 |
| DOIs | |
| State | Published - 2025 |
| Event | 51st International Conference on Very Large Data Bases, VLDB 2025 - London, United Kingdom Duration: Sep 1 2025 → Sep 5 2025 |
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)
- General Computer Science
Fingerprint
Dive into the research topics of 'Analytics Are Heavy. The DBMS Is Busy. When Will My Mission-Critical Transaction Start Running?'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver