Building Large, Complex, Distributed Safety-Critical OperatingSystems
Real-Time Systems - Special issue on safety-critical systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Guaranteed On-Line Weakly-Hard Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
| Hi-index | 0.00 |
The problem of scheduling weakly hard real-time tasks is addressed in this paper. The paper first analyzes the characters of µ-pattern and weakly hard real-time constraints, then, presents two scheduling algorithms, Meet Any Algorithm and Meet Row Algorithm, for weakly hard real-time systems. Different from traditional algorithms used to guarantee deadlines, Meet Any Algorithm and Meet Row Algorithm can guarantee both deadlines and constraints. Meet Any Algorithm and Meet Row Algorithm try to find out the probabilities of tasks breaking constraints and increase task's priority in advance, but not till the last moment. Simulation results show that these two algorithms are better than other scheduling algorithms dealing with constraints and can largely decrease worst-case computation time of real-time tasks.