This paper describes ongoing investigations at Microsoft Research into algorithms for adaptive real-time scheduling and resource management. We are implementing a system that will allow sets of independently authored real-time applications to be scheduled, providing both initial resource negotiation and dynamic feedback to applications about their resource consumption. Instead of relying on human beings to pre-compute scheduling and resource requirements, applications will be able to dynamically adapt their run-time behavior to the resources available. Under overload conditions, user preferences and policies will be applied in order to bring the total resource requirements within available resources. This will permit chosen applications to continue executing perfectly even while others execute with dynamically renegotiated resource grants or are gracefully shut down, as per user preferences. We believe that this approach will lead to real-time scheduling and resource management algorithms that are appropriate for workstation and home multimedia environments.
[1]
C. D. Locke,et al.
Best-effort decision-making for real-time scheduling
,
1986
.
[2]
J. Duane Northcutt,et al.
Mechanisms for Reliable Distributed Real-Time Operating Systems: The Alpha Kernel
,
1987
.
[3]
Raymond Keith Clark,et al.
Scheduling dependent real-time activities
,
1990
.
[4]
David P. Maynard,et al.
Decentralized Real-Time Scheduling
,
1990
.
[5]
Helen Custer,et al.
Inside Windows NT
,
1992
.
[6]
J. Duane Northcutt,et al.
Bus Bandwidth Management in a High Resolution Video Workstation
,
1992,
NOSSDAV.