UFS is an eBPF unfair scheduler that improves time-sensitive task throughput by up to 2X and halves tail latency in mixed PostgreSQL workloads by limiting background tasks to idle capacity and using hints to prevent priority inversion.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Unfair by design: eBPF-based scheduling of mixed database workloads
UFS is an eBPF unfair scheduler that improves time-sensitive task throughput by up to 2X and halves tail latency in mixed PostgreSQL workloads by limiting background tasks to idle capacity and using hints to prevent priority inversion.