The CPU scheduling algorithm (in UNIX) is a simple priority algorithm. The priority for a process is computed as the ratio of the CPU time actually used by the process to the real time that has passed. The lower the figure, the higher the priority. Priorities are recalculated every tenth of a second.

a. What kind of jobs are favored by this type of algorithm?

b. If there is no I/O being performed, this algorithm reduces to a round-robin algorithm. Explain.

c. Discuss this algorithm in terms of the scheduling objectives given in the text.