Demo Data from EDBT 2026 / reviewers in the wild / expert
Pascal Reich
dblp:426/1521
· DBLP profile ↗
1ranked-venue papers
0as 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 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 · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Embedded and real-time systems › real-time scheduling › reservation-based scheduling
constant bandwidth server |
0.9 | 1 | 2025 | Work-in-Progress: A Practical Linux Framework for Weakly-Hard Tasks with Constant Bandwidth Server · RTSS 2025 |
Embedded and real-time systems
real-time scheduling |
0.9 | 1 | 2025 | Work-in-Progress: A Practical Linux Framework for Weakly-Hard Tasks with Constant Bandwidth Server · RTSS 2025 |
Embedded and real-time systems › real-time scheduling
weakly-hard real-time systems |
0.9 | 1 | 2025 | Work-in-Progress: A Practical Linux Framework for Weakly-Hard Tasks with Constant Bandwidth Server · RTSS 2025 |
Operating systems › real-time systems
real-time operating systems |
0.3 | 1 | 2025 | Work-in-Progress: A Practical Linux Framework for Weakly-Hard Tasks with Constant Bandwidth Server · RTSS 2025 |
Methods — techniques the papers use, named apart from their topics
user-space API · 1.7constrained-deadline EDF analysis · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Work-in-Progress: A Practical Linux Framework for Weakly-Hard Tasks with Constant Bandwidth ServerabstractWeakly-hard real-time systems enhance resource efficiency by allowing bounded deadline misses, but practical support in existing platforms remains limited. In this work-in-progress, we present the CBS-based Weakly-Hard Framework, which maps tasks with$(m, K)$constraints into Constant Bandwidth Server (CBS) parameters under the SCHED_DEADLINE policy in Linux. The proposed approach requires no kernel modifications and guarantees schedulability through constrained-deadline EDF analysis. We implemented the framework as a user-space API and evaluated it on a Raspberry Pi platform. Experimental results show improved schedulability compared to existing methods and demonstrate potential opportunities for Quality-of-Service (QoS) enhancement. Marcus Chen, Pascal Reich, Hyunjong Choi |
RTSS | 2 |