Narrowing the speedup factor gap of partitioned EDF

DOI10.1016/j.ic.2021.104743OpenAlexW3145524174MaRDI QIDQ2051780

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

resource augmentation boundpartitioned schedulingapproximate demand bound functionreal-time sporadic tasks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Liu and Layland's schedulability test revisited
• Measuring the performance of schedulability tests
• Exact speedup factors and sub-optimality for non-preemptive scheduling
• The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks
• Speed is as powerful as clairvoyance
• Optimal time-critical scheduling via resource augmentation
• Unnamed Item
• Unnamed Item
• Unnamed Item

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