Journal ArticleLow-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt?Huang, Kaisong (ORCID:0000000179195426); Zhou, Jiatang (ORCID:0009000454209579); Zhao, Zhuoyue (ORCID:000000021631718X); Xie, Dong (ORCID:000000034857900X); Wang, Tianzheng (ORCID:0000000309659592)Traditional non-preemptive scheduling can lead to long latency under workloads that mix long-running and short transactions with varying priorities. This occurs because worker threads tend to monopolize CPU cores until they finish processing long-running transactions. Thus, short transactions must wait for the CPU, leading to long latency. As an alternative, cooperative scheduling allows for transaction yielding, but it is difficult to tune for diverse workloads. Although preemption could potentially alleviate this issue, it has seen limited adoption in DBMSs due to the high delivery latency of software interrupts and concerns on wasting useful work induced by read-write lock conflicts in traditional lock-based DBMSs.</p> <p>In this paper, we propose PreemptDB, a new database engine that leverages recent userspace interrupts available in modern CPUs to enable efficient preemptive scheduling. We present an efficient transaction context switching mechanism purely in userspace and scheduling policies that prioritize short, high-priority transactions without significantly affecting long-running queries. Our evaluation demonstrates that PreemptDB significantly reduces end-to-end latency for high-priority transactions compared to non-preemptive FIFO and cooperative scheduling methods.ACM2025-06-1710672205Proceedings of the ACM on Management of Data331 to 252836-6573https://doi.org/10.1145/37253192339596National Science Foundation