Os HW 6
Os HW 6
Homework 06
Answer the questions below, and submit electronically via elearning. Make sure you
submit a couple hours early at the latest and double check your submission to ensure
everything is in order before the submission time. Your answers should be submitted as
a “.doc”, “.docx”, or “.pdf” file. Your answers should be typed, but scans or pictures of
hand drawn figures and diagrams may be included in the file when needed.
2. (4pts) What is the difference between turnaround time and response time?
4. (4pts) Give an example of a system-oriented criteria not given in the notes. Briefly
explain.
7. (4pts) How does virtual round robin differ from round robin? What would be the
purpose of using virtual round robin of round robin?
8. (4pts) Briefly explain multilevel feedback. How does it differ from the feedback
algorithm?
9. (4pts) Briefly describe exponential averaging. What is its purpose? What scheduling
algorithms might use it?
10. (4pts) Briefly describe Fair Share scheduling. How does it differ from the other
algorithms we talked about?
11. (4pts) In the context of fair-share scheduling, suppose in the previous iteration a
process ran for the first time, and used 10ms on the CPU. This iteration the process
did not run. Assuming that no other process in its group has ran, it has a base
priority of 5, and the group has a weight of 0.5; what will its priority be in the next
iteration?
13. (4pts) What is the difference between hard and soft real-time tasks?
14. (4pts) Briefly define the four techniques for thread scheduling.
15. (4pts) Briefly define the five general areas of requirements for a real-time operating
system.
16. (4pts) Briefly define the four classes of real-time scheduling algorithms.
20. (4pts) What are the two performance benefits of Gang Scheduling?
21. (4pts) How does Dedicated Processor Assignment differ from Gang Scheduling?