A scheduling algorithm for tasks described by time value function
Real-Time Systems
Elastic Scheduling for Flexible Workload Management
IEEE Transactions on Computers
Scheduling Periodic Task Systems to Minimize Output Jitter
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
The Valid Use of Utility in Adaptive Real-Time Systems
Real-Time Systems
Jitter Compensation for Real-Time Control Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
IEEE Transactions on Parallel and Distributed Systems
Adaptive Time-Critical Resource Management Using Time/Utility Functions: Past, Present, and Future
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Workshops and Fast Abstracts - Volume 02
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Utility Accrual Real-Time Scheduling under Variable Cost Functions
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
IEEE Transactions on Computers
Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Preemption in single machine earliness/tardiness scheduling
Journal of Scheduling
A Gravitational Task Model for Target Sensitive Real-Time Applications
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Opportunistic packet scheduling in body area networks
EWSN'11 Proceedings of the 8th European conference on Wireless sensor networks
Proceedings of the 2011 ACM Symposium on Applied Computing
On-line scheduling of target sensitive periodic tasks with the gravitational task model
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
Classic task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Only within these windows the execution of tasks is feasible, and it is considered of uniform utility.Some tasks, however, have target demands in addition: a task should preferably execute at a specific target point within its execution window, but can execute around this point, albeit at lower utility. Examples of such applications include control and media processing.In this paper, we present a task model based on a gravitational analogy to address these issues. Tasks are considered as massive bobs hanging on a pendulum: a single task, left to itself, will execute at the bottom, the target point. If a force, such as the weight of other tasks, is applied, it can be shifted around this point. Thus, tasks' importance and their utility around target points can be expressed. Since the execution of a task cannot be mapped to a point in time, the model allows tasks to express an arbitrary point with its execution to represent the whole execution. This point is called the anchor point.Moreover, we show an example of a scheduling algorithm for this model which finds an approximation to the best compromise of tasks' interests based on the equilibrium state of a pendulum. Nonetheless, this task model is not restricted to a particular scheduling algorithm.Results from a simulation study show the effectiveness of the approach.