Extending EDF for Soft Real-Time Scheduling on Unrelated Multiprocessors
Stephen Tang, Sergey Voronov, James H. Anderson
摘要
Though recent work has established the soft real-time (SRT)-optimality of Earliest-Deadline-First (EDF) variants on multiprocessor models with limited heterogeneity (e.g., uniform speeds or affinity masks), such models are insufficient to describe modern multiprocessors, which have grown increasingly heterogeneous. This fact highlights the need to extend theoretical results to more asymmetric models, such as the unrelated multiprocessor model. This paper presents an EDF variant tailored for this model and proves that it is at least nearly SRT-optimal. Simulation results for random task systems are also presented that suggest that the proposed EDF variant may actually be SRT-optimal.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper1
相关 Paper
- Soft Real-Time Gang SchedulingShareef Ahmed, James H. AndersonRTSS 2023 · 被引用 4 次
- Response-Time Analysis for Limited-Preemptive Self-Suspending and Event-Driven Delay-Induced TasksSrinidhi Srinivasan, Mario Günzel, Geoffrey NelissenRTSS 2024 · 被引用 1 次
- A Utilization-based Test for Non-preemptive Gang Tasks on MultiprocessorsZheng Dong, Cong LiuRTSS 2022 · 被引用 12 次
- Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not NecessaryAlexander Lindermayr, Nicole Megow, Martin RappICML 2023 · 被引用 9 次
- Heterogeneous Quasi-Partitioned SchedulingErnesto Massa, George Lima, Björn Andersson, Vinicius PetrucciRTSS 2021 · 被引用 4 次
