| | |
Summary: A Foray into Uniprocessor
Real-Time Scheduling Algorithms
and Intractibility
Ed Overton
Drs. T. Brylawski 1
and J. Anderson 2
, advisors
December 3, 1997
1
UNC-CH Department of Mathematics
2
UNC-CH Department of Computer Science
Contents
1 Introduction 1
2 Preliminary de nitions and notation 3
3 Schedulablity and a bound on utilization 6
4 Rate Monotonic Scheduling 7
4.1 De nition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
4.2 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
4.2.1 Example 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
|
