Discussion
Consider the following statements about scheduling.
1. A utilisation above unity is always infeasible 2. The rate monotonic bound is necessary and sufficient 3. Earliest deadline first is optimal on one processor
Answer: D
Correct answer: 1 and 3 only are correct
Statements 1 and 3 are correct: utilisation above unity is infeasible for any algorithm, and earliest deadline first is optimal on one processor. Statement 2 overstates the rate monotonic bound, which is sufficient but not necessary - a set exceeding it may still meet every deadline, which is why response time analysis exists.
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