# Question: Consider the following pair of equations as an alternative to

Consider the following pair of equations as an alternative to Equation (9.3):

Where Ubound and Lbound are pre-chosen upper and lower bounds on the estimated value of T. The value of Xn + 1 is used in the shortest-process-next algorithm, instead of the value of Sn + 1. What functions do a and b perform, and what is the effect of higher and lower values on each?

Where Ubound and Lbound are pre-chosen upper and lower bounds on the estimated value of T. The value of Xn + 1 is used in the shortest-process-next algorithm, instead of the value of Sn + 1. What functions do a and b perform, and what is the effect of higher and lower values on each?

## Answer to relevant Questions

In a non-preemptive uni-processor 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 times of r1, r2, and r3, ...In a queuing system, new jobs must wait for a while before being served. While a job waits, its priority increases linearly with time from zero at a rate α. A job waits until its priority reaches the priority of the jobs in ...What is the difference between periodic and aperiodic real-time tasks? Maximum urgency first (MUF) is a real-time scheduling algorithm for periodic tasks. Each task is assigned an urgency that is defined as a combination of two fixed priorities and one dynamic priority. One of the fixed ...Consider a program that accesses a single I/O device and compare un-buffered I/O to the use of a buffer. Show that the use of the buffer can reduce the running time by at most a factor of two.Post your question