Scheduling Issues in Consumer Real-Time

3/12/2000


Click here to start


Table of Contents

Scheduling Issues in Consumer Real-Time

Goal: Coexisting Independent Real-Time Applications

Outline of Talk

Part I: Rialto/NT Introduction Rialto Background Windows NT Implementation Performance and Traces Application Results Conclusions

Soft Real-Time

Why Soft Real-Time on Windows 2000?

Why not use Windows NT as is?

How Real-Time is Windows 2000?

How Real-Time is Windows 2000? (Cont’d)

What We Did

Teaser Capability

How did we do it?

Introduction Rialto Background Windows NT Implementation Performance and Traces Application Results Conclusions

Abstraction: CPU Reservation

Abstraction: Time Constraint

Implementation: Precomputed Scheduling Plan

Scheduling Plan Example

Introduction Rialto Background Windows NT Implementation Performance and Traces Application Results Conclusions

Using the Windows NT Scheduler

Multiprocessor Issues

Affinity vs. Priority

Discrete Time

Implementation Details

Non-invasive Implementation

Complication: Unpredictable Dispatch Latency

Better Living Through Simulation

Introduction Rialto Background Windows NT Implementation Performance and Traces Application Results Conclusions

Test Platform

Context Switch Time

Time to Acquire Reservations

Time to Acquire Constraints

Reservations with a Background Thread

Reservations and Constraints

Dual Processor Traces

Introduction Rialto Background Windows NT Implementation Performance and Traces Application Results Conclusions

Windows Media Player

Media Player Thread Structure (Simplified)

MP3 Playback w/o Contention

Starvation Caused by Competing Thread @ Priority 10

Media Player + Reservation

Priority Inversion Caused by Competing Thread

Media Player Deadlock

Results

Implications of Results

Introduction Rialto Background Windows NT Implementation Performance and Traces Application Results Conclusions

Further Research

Rialto/NT Conclusions

References

Part II: Hierarchical Schedulers with Performance Guarantees and Resource Management

Problem Statement

A Solution: Hierarchical Scheduling

Why Hierarchical Loadable Schedulers?

Why Hierarchical Loadable Schedulers? (Cont’d)

Why Not Hierarchical Schedulers

Performance Guarantees

Composability

The Resource Manager

Thesis Statements

Hierarchical Scheduler Operation

Application Mode Change

Implementation 1

Implementation 2

Related Work

Conclusions

For More Information

Context Switch Time

Not Research Questions

Acquiring a New Guarantee

Interesting Question

Question (Cont’d)

Author: John Regehr

Email: regehr@virginia.edu

Home Page: http://www.cs.utah.edu/~regehr/