A scheduling algorithm for tasks described by time value function
Real-Time Systems
Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments
IEEE Transactions on Computers
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
A resource allocation model for QoS management
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks
DELTA '04 Proceedings of the Second IEEE International Workshop on Electronic Design, Test and Applications
Scheduling of fault-tolerant embedded systems with soft and hard timing constraints
Proceedings of the conference on Design, automation and test in Europe
Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time
Proceedings of the 2010 ACM Symposium on Applied Computing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
This paper addresses the problem of scheduling for realtime systems that include both hard and soft tasks. The relative importance of soft tasks and how the quality of results is affected when missing a soft deadline are captured by utility functions associated to soft tasks. Thus the aim is to find the execution order of tasks that makes the total utility maximum and guarantees hard deadlines. We consider time intervals rather than fixed execution times for tasks. Since a purely off-line solution is too pessimistic and a purely online approach incurs an unacceptable overhead due to the high complexity of the problem, we propose a quasi-static approach where a number of schedules are prepared at design-time and the decision of which of them to follow is taken at run-time based on the actual execution times. We propose an exact algorithm as well as different heuristics for the problem addressed in this paper.