Lecture image placeholder

Premium content

Access to this content requires a subscription. You must be a premium user to view this content.

Monthly subscription - $9.99Pay per view - $4.99Access through your institutionLogin with Underline account
Need help?
Contact us
Lecture placeholder background
VIDEO DOI: https://doi.org/10.48448/3x2s-y144

technical paper

IEEE RTSS 2021

December 09, 2021

Germany

Tighter Bounds of Speedup Factor of Partitioned EDF for Constrained-Deadline Sporadic Tasks

Please log in to leave a comment

Downloads

SlidesPaperTranscript English (automatic)

Next from IEEE RTSS 2021

Efficiently Approximating the Worst-Case Deadline Failure Probability under EDF
technical paper

Efficiently Approximating the Worst-Case Deadline Failure Probability under EDF

IEEE RTSS 2021

+3Jian-Jia Chen
Georg von der Brüggeen and 5 other authors

09 December 2021

Similar lecture

Partitioned Scheduling of Recurrent Real-Time Tasks
technical paper

Partitioned Scheduling of Recurrent Real-Time Tasks

IEEE RTSS 2021

Pontus Ekberg
Pontus Ekberg and 1 other author

09 December 2021