动态优先级实时的系统中的并行边信道
On Scheduler Side-Channels in Dynamic-Priority Real-Time Systems
摘要：
虽然调度器侧信道的存在最近已经证明了固定优先级的实时的【形】系统（RTS），有没有类似的探索动态优先级系统。这种调度算法的动态特性，例如，EDF在这方面提出了重大挑战。在本文中，我们证明了边通道存在于动态优先级实时的【形】系统。使用这个侧通道，我们提出的DyPS算法是能够有效地推断，高精度，关键的任务信息，从一个非特权（用户空间）任务的有利位置。除了证明DyPS的有效性，我们还探讨了使用大量的合成任务集影响这种攻击算法的各种因素。我们还比较了国家的最先进的，并证明了我们提出的DyPS算法优于ScheduLeak算法在攻击EDF RTS。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
