(0)Real Time Scheduling
• Many real time systems run a known collection of tasks. The execution time of the tasks is frequently known ahead of time.
• Tasks have deadlines by which they must complete.
• If a task that runs for 3 time units must be done at time 10, it must start by time 7.
• If two tasks that runs for 3 time units each must be done at time 10, one must start by time 4.
Welcome
Liezel P. Magcalayo Blog.......('',
Blog Archive
-
▼
2009
(22)
-
▼
August
(12)
- (0) Resource allocation grapha set of vertices V a...
- RESOURCE ALLOCATION GRAPH(0)A Resource Allocation ...
- (0) recovery from deadlock Recovery through preemp...
- (0) deadlock detection Often neither de...
- (0)Deadlock PreventionRestrain the ways requests c...
- (0) Methods for handling deadlockDeadlock Preventi...
- (0)deadlock characterization Deadlock can arise i...
- (0) thread scheduling>the thread scheduler, part o...
- (0)Real Time Scheduling• Many real time systems ru...
- (0) Multiprocessor SchedulingVery little has to be...
- Substantial Information about threads of Operating...
- (0) CPU Scheduling algorothmsCPU scheduling algori...
-
▼
August
(12)
Subscribe to:
Post Comments (Atom)
0 comments:
Post a Comment