Scheduling algorithms based on weakly hard real-time constraints

DOI10.1007/BF02945471zbMath1083.68527OpenAlexW1970661763MaRDI QIDQ1884329

FuMin Yang, Gang Tu, Yan-Sheng Lu

Publication date: 28 October 2004

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02945471

zbMATH Keywords

constraintunsatisfied \(\mu\)-patternweakly hard real-time

Mathematics Subject Classification ID

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

Cites Work

• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Scheduling algorithms based on weakly hard real-time constraints