Performance guarantee for edf under overload

DOI10.1016/J.JALGOR.2003.10.004MaRDI QIDQ4815773zbMATH OpenOpenAlexWikidataFDO

Authors Tsuen-Wan Johnny Ngan, Kar-Keung To, Tak-Wah Lam

Publication date 8 September 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10722/48426

zbMATH Keywords

online deadline scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Performance guarantee for online deadline scheduling in the presence of overload
• A tighter extra-resource analysis of online deadline scheduling
• Aggressive online deadline scheduling
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• scientific article; zbMATH DE number 1305455

Cited in

(6)

• Statistical analysis of delay bound violations at an earliest deadline first (EDF) scheduler
• The space of EDF deadlines: The exact region and a convex approximation
• On packet scheduling with adversarial jamming and speedup
• Performance guarantee for online deadline scheduling in the presence of overload
• A tighter extra-resource analysis of online deadline scheduling
• Rate monotonic vs. EDF: judgment day

Describes a project that uses

Uses Software

• MOCA

This page was built for publication: Performance guarantee for edf under overload

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