Operating Systems Questions (Please Help if you can)

1. An i/o-bound program is one that, if run alone, would spend more time waiting for i/o

than using the cpu. A cpu-bound program is the opposite. Suppose a short-term scheduling

algorithm favors those programs that have used little cpu time in the recent past. Explain

why this algorithm favors i/o-bound programs and yet, does not permanently deny cpu time

to cpu-bound programs.

2. Is busy waiting always less effcient (in terms of using cpu time) than a blocking wait?

Explain.

3. We have seen the use of semaphore to implement monitors. Assume that your system

provides a monitor implementation built into the os and you are required to implement

semaphores using the monitor calls. How will you go about it? [Hint: Think about the

integer to hold semaphore count as a critical resource.