Discussion
The Liu and Layland utilisation bound for \( n \) tasks under rate monotonic scheduling is
Answer: D
It falls from 1.0 for one task through 0.828 for two and 0.780 for three toward 0.693 as the number grows. A set below the bound is certainly schedulable; a set above it may still be, and response time analysis must then be used.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development