Extending EDF for Soft Real-Time Scheduling on Unrelated Multiprocessors
Stephen Tang, Sergey Voronov, James H. Anderson
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on1
Related papers
- Soft Real-Time Gang SchedulingShareef Ahmed, James H. AndersonRTSS 2023 · 4 citations
- Response-Time Analysis for Limited-Preemptive Self-Suspending and Event-Driven Delay-Induced TasksSrinidhi Srinivasan, Mario Günzel, Geoffrey NelissenRTSS 2024 · 1 citation
- A Utilization-based Test for Non-preemptive Gang Tasks on MultiprocessorsZheng Dong, Cong LiuRTSS 2022 · 12 citations
- Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not NecessaryAlexander Lindermayr, Nicole Megow, Martin RappICML 2023 · 9 citations
- Heterogeneous Quasi-Partitioned SchedulingErnesto Massa, George Lima, Björn Andersson, Vinicius PetrucciRTSS 2021 · 4 citations
