Demo Data from EDBT 2026 / reviewers in the wild / expert
Noah Weaver
dblp:286/3421
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 61% GPUs and heterogeneous computing · 39% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
GPUs and heterogeneous computing
GPU scheduling |
0.9 | 1 | 2025 | Work-in-Progress: Enabling Transparent Priority Scheduling for NVIDIA GPUs · RTSS 2025 |
Embedded and real-time systems › real-time scheduling
priority scheduling |
0.9 | 1 | 2025 | Work-in-Progress: Enabling Transparent Priority Scheduling for NVIDIA GPUs · RTSS 2025 |
Methods — techniques the papers use, named apart from their topics
static priority queue · 0.9parameter communication · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Work-in-Progress: Enabling Transparent Priority Scheduling for NVIDIA GPUsabstractModern embedded systems increasingly rely on GPUs for safety-critical tasks such as object detection in autonomous vehicles and data visualization in medical diagnostics. These applications require running high-priority workloads alongside lower-priority tasks on shared GPU hardware due to cost, power, or space constraints. However, NVIDIA GPUs employ round-robin scheduling that treats all tasks equally, causing unpredictable delays for critical workloads. Existing GPU priority scheduling solutions require application modifications, introduce high overhead, or depend on specialized embedded hardware. We present a GPU-level static priority scheduler built on the nvsched framework that requires no application changes and runs on commodity GPUs. Our scheduler maintains tasks in a priority-ordered queue and uses a parameter communication system to enable dynamic priority updates from userspace. Experiments with MobileNetV3 inference under GPU contention demonstrate 32-41% lower maximum latency for high-priority tasks when using our scheduler compared to NVIDIA's default scheduler. Our approach provides practical priority control for GPU workloads while maintaining low scheduling overhead. Noah Weaver, Joshua Bakita |
RTSS | 1 |