Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
The meaning and role of value in scheduling flexible real-time systems
Journal of Systems Architecture: the EUROMICRO Journal - Special issue on real-time systems
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Optimal Reward-Based Scheduling of Periodic Real-Time Tasks
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Fast, Best-Effort Real-Time Scheduling Algorithms
IEEE Transactions on Computers
Efficient overloading techniques for primary-backup scheduling in real-time systems
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Dynamic tuning of feature set in highly variant interactive applications
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
On Resource Overbooking in an Unmanned Aerial Vehicle
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Overload provisioning in mixed-criticality cyber-physical systems
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.01 |
In this paper we propose a novel scheduling framework for a real-time environment that experiences dynamic changes. This framework is capable of adjusting the system workload in incremental steps under overloaded conditions such that the most critical tasks in the system are always scheduled and the total value of the system is maximized. Each task has an assigned criticality value and consists of two parts, a mandatory part and an optional part. A timely answer is available after the mandatory part completes execution and its value may be improved by executing the entire optional part. Optional parts can be discarded in overloaded conditions. The process of selecting optional parts to discard while maximizing the value of the system requires the exploration of a potentially large number of combinations. Since this process is too time consuming to be computed on-line, an approximate algorithm is executed incrementally whenever the processor would otherwise be idle, progressively refining the quality of the solution. This criteria allows the scheduler to handle overloads with low cost while maximizing the use of the available resources and without jeopardizing the temporal constraints of the most critical tasks in the system. Simulation results show that few stages of the algorithm need to be executed for achieving a performance with near-optimal results.