Introduction
Real-Time Systems (RTS) are the backbone of safety-critical infrastructure, from automotive braking systems to medical implants. These systems rely on schedulers to ensure tasks meet strict deadlines. Historically, scheduler side-channels have allowed unprivileged "observer" tasks to infer the execution patterns of high-priority "victim" tasks. However, existing attacks like ScheduLeak were designed for Fixed-Priority (FP) systems. It was widely believed that Dynamic-Priority systems, such as Earliest Deadline First (EDF), were inherently more resistant to such reconnaissance due to their "priority-flipping" nature.
The Challenge of Dynamic Priorities
In EDF scheduling, task priorities are not static; they change at runtime based on absolute deadlines. This dynamism breaks the "persistent priority" assumption required by previous attacks. In an EDF system, an observer task might have a higher priority than the victim at one moment and a lower priority the next. This makes it difficult to determine if a delay in the observer's execution is due to preemption by the victim or simply the observer's own scheduling parameters.
The DyPS Methodology
To overcome these challenges, researchers developed DyPS (Dynamic-Priority ScheduLeak). DyPS is a four-step algorithm designed to handle the uncertainty of dynamic priorities by identifying "safe" observation windows.
- Observer Phase Reconstruction ($\phi_o$): The observer first establishes its own arrival "ground truth" by analyzing multiple start times to find the earliest possible wake-up point.
- Identifying Valid Execution Intervals: DyPS filters out intervals where the observer might have had a higher priority than the victim. Only intervals where the victim is guaranteed to have higher priority (if it arrives) are used for inference.
- Candidate Computation: By analyzing preemption points within these valid windows, the algorithm generates potential arrival times for the victim.
- Victim Phase Inference: Using a "schedule ladder diagram," DyPS finds the most consistent arrival pattern across multiple periods to pinpoint the victim's phase ($\phi_v$).
Evaluation and Results
The effectiveness of DyPS was evaluated using 6,000 synthetic task sets generated via the UUniFast algorithm. These sets included realistic factors like execution jitter and sporadic task arrivals.
The results demonstrate a significant leap in precision over previous methods. While ScheduLeak struggles in EDF environments, achieving a mean precision of only 0.54, DyPS reaches a precision of 0.978.
As shown in the figure, DyPS quickly converges to near-perfect precision within an observation period of approximately 10x the Least Common Multiple (LCM) of the task periods. The attack remains robust even under high system utilization (up to 90%) and increasing task counts.
Discussion and Future Work
DyPS effectively debunks the notion that EDF scheduling provides "security through complexity." However, certain defenses remain possible. For instance, perfectly harmonic task phases and periods can create constant delays that degrade attack precision.
Future research will likely focus on extending these attacks to multi-core systems, where parallel execution introduces new complexities, and developing dedicated "schedule randomization" countermeasures to protect EDF-based real-time systems from timing-based side-channel leaks.
Summary updated