Opportunistic scheduling in a constraint-rich world

Authors:
David Johnstone;Steven Bradley
Affiliations:
Department of Computer Science, University of Durham, UK;Department of Computer Science, University of Durham, UK
Venue:
ACM SIGBED Review - Special issue: IEEE RTAS 2005 work-in-progress
Year:
2005

Citing 6
Cited 0

Dynamic priority ceilings: a concurrency control protocol for real-time systems

Real-Time Systems
Just-in-case scheduling

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Replica Determinism and Flexible Scheduling in Hard Real-Time Dependable Systems

IEEE Transactions on Computers
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
Managing Multi-Mode Tasks with Time Cost and Quality Levels using Optimal Discrete Control Synthesis

ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
The 3rd international planning competition: results and analysis

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The latest planners and schedulers allow expressive domain modelling and problem definition, particularly with respect to the inclusion of constrained resource usage and inter-task dependencies. This increased complexity removes the ability to guarantee schedulability of a problem at run-time.In hard real-time systems, where 'hard' emphasizes the critical nature of meeting task deadines, the estimated worst-case execution time is used in the task representation. If a solely static framework is used to schedule these systems, the pessimism in the prediction of task execution times will lead to unused resources.This paper describes a framework to include a local dynamic scheduler with a large-scale planner or scheduler. The local scheduler can take advantage of any unused resources by scheduling additional task sets. It can also handle online plan repair by switching between different quality levels of tasks.