SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
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
Value vs. deadline scheduling in overload conditions
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Machine scheduling with earliness, tardiness and non-execution penalties
Computers and Operations Research
On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Hi-index | 0.00 |
This paper presents a new task model where jobs are divided into segments A, B and C. Segment B has a specific time-interval where it should execute to fulfill some application constraints. We consider the execution of B as valid if performed inside that time-interval, otherwise, its contribution may be valueless to its task. We adapt some scheduling approaches from the literature and present a feasibility test in terms of expected QoS for our scheduling problem.