Question

The traditional UNIX scheduler enforces an inverse relationship between priority numbers and priorities: the higher the number, the lower the priority. The scheduler recalculates process priorities once per second using the following function:

Priority = (recent CPU usage / 2) + base

where base = 60 and recent CPU usage refers to a value indicating how often 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 three processes when priorities are recalculated? Based on this information, does the traditional UNIX scheduler raise or lower the relative priority of a CPU-bound process?

Answer 1

Answer:

l think that one syllable always being here and the end is going so I'm trying my hard drive back after my exams today so I've had ha weasay and I 7.yeh to go for all my time ⏲️❤and longer the form of the strongest of my hair fall through a very very thick layer and I am not a bit