While the existence of scheduler side-channels has been demonstrated recently for fixed-priority real-time systems (RTS), there have been no similar explorations for dynamic-priority systems. The dynamic nature of such scheduling algorithms, e.g., EDF, poses a significant challenge in this regard. In this paper we demonstrate that side-channels exist in dynamic priority real-time systems. Using this side-channel, our proposed DyPS algorithm is able to effectively infer, with high precision, critical task information from the vantage point of an unprivileged (user space) task. Apart from demonstrating the effectiveness of DyPS, we also explore the various factors that impact such attack algorithms using a large number of synthetic task sets. We also compare against the state-of-the-art and demonstrate that our proposed DyPS algorithms outperform the ScheduLeak algorithms in attacking the EDF RTS.

中文翻译：

---

动态优先实时系统中的调度器边信道

虽然最近在固定优先级实时系统 (RTS) 中证明了调度器边信道的存在，但对于动态优先级系统还没有类似的探索。此类调度算法（例如 EDF）的动态特性在这方面提出了重大挑战。在本文中，我们证明了动态优先级实时系统中存在侧信道。使用这个侧信道，我们提出的 DyPS 算法能够从非特权（用户空间）任务的有利位置以高精度有效推断关键任务信息。除了证明 DyPS 的有效性外，我们还使用大量合成任务集探索了影响此类攻击算法的各种因素。