Real Time Systems
Class Meeting #4: Fixed-priority preemptive scheduling
Topics for Today
Check that everyone's FSU id card number is known to system group, for access to 016 Love laboratory
Work through proof of NP-hardness of static cyclic scheduling
If time permits, introduced basics of preemptive scheduling
Explain
homework assignment #2
Things for You to Do
Read chapter 6 of text.
Work on homework assignment #2
T. P. Baker
. ($Id: wk02w.html,v 1.2 2008/09/24 13:31:55 baker Exp baker $)