The space of EDF deadlines: The exact region and a convex approximation

DOI10.1007/S11241-008-9060-7zbMATH Open1170.93358OpenAlexW2110342729MaRDI QIDQ842733FDOQ842733

Authors: Enrico Bini, Giorgio C. Buttazzo 

Publication date: 25 September 2009

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11382/302690

Recommendations

• Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
• On optimal lateness and tardiness scheduling in real-time systems
• An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
• Performance guarantee for edf under overload
• Performance guarantee for online deadline scheduling in the presence of overload

zbMATH Keywords

performance optimizationearliest deadline firstcomputer controlled systemsdeadline assignment

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Control/observation systems involving computers (process control, etc.) (93C83)

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Measuring the performance of schedulability tests
• Stochastic analysis and control of real-time systems with random time delays
• Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
• A unified approach to the theory of sampling systems

Cited In (3)

• Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
• Beyond the weakly hard model: measuring the performance cost of deadline misses
• Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities

This page was built for publication: The space of EDF deadlines: The exact region and a convex approximation

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