Scheduling algorithms based on weakly hard real-time constraints
Journal of Computer Science and Technology
An architecture to support cooperating mobile embedded systems
Proceedings of the 1st conference on Computing frontiers
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Robust scheduling in team-robotics
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
IEEE Transactions on Computers
Proceedings of the 2011 International Conference on Communication, Computing & Security
Reconfiguration-aware real-time scheduling under QoS constraint
Proceedings of the 16th Asia and South Pacific Design Automation Conference
Energy minimization for real-time systems with (m; k)-guarantee
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Embedded Systems Design
| Hi-index | 0.01 |
A weakly hard real-time system is a system that can toleratesome degree of missed deadlines provided that thisnumber is bounded and guaranteed off-line.In this pa-perwe present an on-line scheduling framework called Bi-ModalScheduler (BMS) for weakly-hard real-time systems.It is characterized by two modes of operation. In normalmode tasks can be scheduled with a generic scheduler (possiblybest-effort).Weakly hard constraints are guaranteedto be satisfied by switching, whenever necessary, to a panicmode for which schedulability tests exist that guarantee thatdeadlines are met.Due to the sources of pessimism in theanalysis (mainly WCET and critical instant assumptions)the worst case situations may never arise, thus almost allthe time all deadlines are met, only at peak loads somedeadlines may be missed, however the behaviour of the sys-temis predicable and bounded.This allows building systemswhich maximise resource usage during normal operationand that resort to a guaranteed and predictable performancedegradation specified by the weakly hard constraintsshould a transient overload arise.