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 multiprogrammed batch system.What does it mean to preempt a process?What are the steps performed by an OS to create a new process?Give four general examples of the use of threads in a single-user multiprocessing system.Explain the potential performance disadvantage of a microkernel OS
Post your question