Question: suppose that a scheduling algorithm at the level of the short term cpu scheduling favours that posses that have used least processor time in the

suppose that a scheduling algorithm at the level of the short term cpu scheduling favours that posses that have used least processor time in the recent past . will the algorithm favour I/O BOUND PAGES PROGRAM? WHY ? WILL THIS AGORITHM PERMANANTLY STARVE CPU BOUND PROGRAMS ? WHY?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!