1 files changed, 19 insertions, 0 deletions
diff --git a/references/references.bib b/references/references.bib
index 051bb32..ec15f6b 100644
--- a/references/references.bib
+++ b/references/references.bib
@@ -2063,3 +2063,22 @@ month = aug,
 pages = {103–111},
 numpages = {9}
 }
+
+@article{userspace-preempt,
+author = {Huang, Kaisong and Zhou, Jiatang and Zhao, Zhuoyue and Xie, Dong and Wang, Tianzheng},
+title = {Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt?},
+year = {2025},
+issue_date = {June 2025},
+publisher = {Association for Computing Machinery},
+address = {New York, NY, USA},
+volume = {3},
+number = {3},
+url = {https://doi.org/10.1145/3725319},
+doi = {10.1145/3725319},
+abstract = {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.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.},
+journal = {Proc. ACM Manag. Data},
+month = jun,
+articleno = {182},
+numpages = {25},
+keywords = {database systems, low-latency transactions, preemptive scheduling, user interrupts}
+}