Computer Science, asked by wisdomp863, 9 months ago

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 for process P1 is 40, for process P2 is 18 and for process P3 is 10. 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?

Answers

Answered by cutequeen2154
2

Explanation:

प्लीज फॉलो मी फॉलो मी आई लव यू पर्सनली

Answered by SwathiKrishna240607
0

Answer:

Sorry, I can't understand your question.

Similar questions