An I/O-bound program is one that, if run alone, would spend more time waiting for I/O than using the processor. A processor-bound program is the opposite. Suppose a short-term scheduling algorithm favors those programs that have used little processor time in the recent past. Explain why this algorithm favors I/O-bound programs and yet does not permanently deny processor time to processor-bound programs.
Answer to relevant QuestionsContrast the scheduling policies you might use when trying to optimize a time-sharing system with those you would use to optimize a multi-programmed batch system. Why does Figure have two blocked states? Assume that at time 5 no system resources are being used except for the processor and memory. Now consider the following events: At time 5: P1 executes a command to read from disk unit 3. At time 15: P5’s time slice ...In a number of early computers, an interrupt caused the register values to be stored in fixed locations associated with the given interrupt signal. Under what circumstances is this practical technique? Explain why it is ...The Solaris documentation states that a ULT may yield to another thread of the same priority. Isn’t it possible that there will be a run able thread of higher priority and that therefore the yield function should result in ...
Post your question