A weakly hard real-time schedule algorithm based on cutting down

DOI10.3724/SP.J.1001.2008.01837MaRDI QIDQ3406361zbMATH OpenOpenAlexFDO

Authors Tong Wu, Shiyao Jin, Huafeng Liu, Jiming Chen

Publication date 12 February 2010

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

Full work available at URL https://doi.org/10.3724/sp.j.1001.2008.01837

zbMATH Keywords

dynamic failureexecuting sequenceturn point

Mathematics Subject Classification ID

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

Recommendations

• Scheduling algorithms based on weakly hard real-time constraints
• A new algorithm for scheduling periodic, real-time tasks
• Constraint specification of weakly hard real-time systems
• scientific article; zbMATH DE number 4199942
• Rate monotonic scheduling in hard real-time systems

Cited in

(4)

• Optimizing path real-time logic for unified real-time system
• Scheduling algorithms based on weakly hard real-time constraints
• An integrated DBP for streams with (m, k)-firm real-time guarantee
• Constraint specification of weakly hard real-time systems

This page was built for publication: A weakly hard real-time schedule algorithm based on cutting down

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