Discussion
Match the algorithm with its utilisation bound for a large task set.
1. Rate monotonic 2. Earliest deadline first 3. Rate monotonic with harmonic periods
P. 1.000 Q. 0.693 R. 1.000 also
Answer: A
The three figures are the ones to carry: fixed priorities cost about thirty per cent of the processor in the general case, dynamic priorities cost nothing, and choosing harmonic periods recovers the loss without abandoning fixed priorities.
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