and 5 others joined a min ago.
0
3.8kviews
Explain the utilization bound in task scheduling in light of Rate Monotonic Scheduling algorithm.
1 Answer
0
60views
written 6.8 years ago by
teamques10
★ 70k
|
• modified 6.8 years ago |
- Rate monotonic scheduling Algorithm works on the principle of preemption.
- Preemption occurs on a given processor when higher priority task blocked lower priority task from execution.
- This blocking occurs due to priority level of different tasks in a given task set. rate monotonic is a preemptive algorithm which means if …
and 5 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.