- With RR, interactive computing is possible. Why does RR enableinteractive computing?
- The traditional UNIX scheduler enforces an inverse relationshipbetween priority numbers and priorities: The higher the number, thelower the priority. The scheduler recalculates process prioritiesonce per second using the following function:
Priority = (recent CPU usage / 2 ) +base
where base = 60 and recent CPUusage refers to a value indicating how often a process hasused the CPU since priorities were last recalculated.
Assume that recent CPU usage forprocess P1 is 40, process P2 is 18, and process P3 is 10.
- What will be the new priorities for these three processes whenpriorities are recalculated?
- Based on this information, does the traditional UNIX schedulerraise or lower the relative priority of a CPU-bound process?
