The traditional UNIX scheduler enforces an inverse relationship betweenpriority numbers
Chapter 6, Problem 6.9(choose chapter or problem)
The traditional UNIX scheduler enforces an inverse relationship betweenpriority numbers and priorities: the higher the number, the lower thepriority. The scheduler recalculates process priorities once per secondusing the following function:Priority = (recent CPU usage / 2) + basewhere base = 60 and recent CPU usage refers to a value indicating howoften a process has used the CPU since priorities were last recalculated.Assume that recent CPU usage is 40 for process P1, 18 for process P2,and 10 for process P3. What will be the new priorities for these threeprocesses when priorities are recalculated? Based on this information,does the traditional UNIX scheduler raise or lower the relative priorityof a CPU-bound process?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer