Narrowing the speedup factor gap of partitioned EDF

DOI10.1016/J.IC.2021.104743MaRDI QIDQ2051780zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 25 November 2021

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2021.104743

zbMATH Keywords

approximate demand bound functionpartitioned schedulingreal-time sporadic tasksresource augmentation bound

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Partitioned EDF scheduling: a closer look
• Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks
• An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
• Partitioned EDF scheduling on a few types of unrelated multiprocessors
• A constant-approximate feasibility test for multiprocessor real-time scheduling

Cites work

• EDF-schedulability of synchronous periodic task systems is coNP-hard
• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Intractability issues in mixed-criticality scheduling
• Liu and Layland's schedulability test revisited
• Measuring the performance of schedulability tests
• On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling
• Optimal time-critical scheduling via resource augmentation
• Speed is as powerful as clairvoyance
• The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks

Cited in

(7)

• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Partitioned EDF scheduling on a few types of unrelated multiprocessors
• Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks
• Partitioned EDF scheduling: a closer look
• Robust partitioned scheduling for real-time multiprocessor systems
• Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
• Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms

This page was built for publication: Narrowing the speedup factor gap of partitioned EDF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051780)