Questions from Operating Systems

Q: Assume the following burst-time pattern for a process: 6

Assume the following burst-time pattern for a process: 6, 4, 6, 4, 13, 13, 13, and assume the initial guess is 10. Produce a plot similar to those of Figure 9.9. Figure 9.9:

Q: Consider the following pair of equations as an alternative to Equation 9

Consider the following pair of equations as an alternative to Equation 9.3: Sn+1=αTn+(1−α)SnXn+1= min [Ubound, max[Lbound, (βSn+1)]] where Ubound and Lbound are prechosen upper and lower bounds on the...

Q: In the bottom example in Figure 9.5 , process A

In the bottom example in Figure 9.5 , process A runs for two time units before control is passed to process B. Another plausible scenario would be that A runs for three time units before control is pa...

Q: Why is it impossible to determine a true global state?

Why is it impossible to determine a true global state?

Q: List and briefly define the four main elements of a computer.

List and briefly define the four main elements of a computer.

Q: In a nonpreemptive uniprocessor system, the ready queue contains three jobs

In a nonpreemptive uniprocessor system, the ready queue contains three jobs at time t immediately after the completion of a job. These jobs arrived at times t1, t2, and t3 with estimated execution tim...

Q: Prove that the minimax response ratio algorithm of the preceding problem minimizes

Prove that the minimax response ratio algorithm of the preceding problem minimizes the maximum response ratio for a given batch of jobs. (Hint: Focus attention on the job that will achieve the highes...

Q: Consider a set of three periodic tasks with the execution profiles of

Consider a set of three periodic tasks with the execution profiles of Table 10.7. Develop scheduling diagrams similar to those of Figure 10.5 for this set of tasks. Table 10.7: Figure 10.5:

Q: A processor is multiplexed at infinite speed among all processes present in

A processor is multiplexed at infinite speed among all processes present in a ready queue with no overhead. (This is an idealized model of round-robin scheduling among ready processes using time slice...

Q: Consider a variant of the RR scheduling algorithm where the entries in

Consider a variant of the RR scheduling algorithm where the entries in the ready queue are pointers to the PCBs. a. What would be the effect of putting two pointers to the same process in the ready qu...