On Schedulability Analysis of EDF Scheduling by Considering Suspension as Blocking
Mario G\"unzel, Jian-Jia Chen
TL;DR
This paper critiques a previous schedulability analysis for EDF scheduling with suspensions, providing a counterexample that highlights its limitations in uniprocessor systems.
Contribution
It presents a counterexample to Devi's 2003 analysis, revealing inaccuracies in the existing suspension-aware schedulability method for EDF.
Findings
Devi's analysis can be incorrect in certain suspension scenarios
Counterexample demonstrates the need for improved analysis methods
Highlights limitations of current suspension-aware schedulability tests
Abstract
During the execution of a job, it may suspend itself, i.e., its computation ceases to process until certain activities are complete to be resumed. This paper provides a counterexample of the schedulability analysis by Devi in Euromicro Conference on Real-Time Systems (ECRTS) in 2003, which is the only existing suspension-aware analysis specialized for uniprocessor systems when preemptive earliest-deadline-first (EDF) is applied for scheduling dynamic selfsuspending tasks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReal-Time Systems Scheduling · Embedded Systems Design Techniques · Petri Nets in System Modeling