Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Elastic Scheduling for Flexible Workload Management
IEEE Transactions on Computers
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Elastic Task Model for Adaptive Rate Control
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Resource Sharing in EDF-Scheduled Systems: A Closer Look
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Resource adaptations with servers for hard real-time systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Tractable schedulability analysis and resource allocation for real-time multimodal systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
| Hi-index | 0.00 |
In a periodic real-time system scheduled by the EDF (Earliest Deadline First) algorithm (Liu and Layland, J. ACM 20(1), 40---61, 1973; Barauh, Proc. of the 27th IEEE International Real-Time Systems Symposium, 379---387, 2006; Buttazzo, J. Real-Time Syst. 29(1), 5---26, 2005), when new tasks have to be inserted into the system at run-time and/or current tasks request to increase their rates in response to internal or external events, the new sum of the utilizations after the insertion and/or acceleration should be limited, otherwise, one or more current tasks should usually be compressed (their periods being prolonged) in order to avoid overload. Buttazzo offered a time from which on this kind of adjustment can be done without causing any deadline miss in the system (Buttazzo et al., IEEE Trans. Comput. 51(3), 289---302, 2002). It is, however, not early enough. In this paper, an earlier time is given and formally proved.