Consider a computer system to which two types of computer jobs are submitted. The mean time to run each type of job is 1/µ. The interarrival times for each type of job are exponential, with an average of ?i type i jobs arriving each hour. Consider the following three situations.
(i) Type 1 jobs have priority over type 2 jobs, and preemption is allowed.
(ii) Type 1 jobs have priority over type 2 jobs, and no preemption is allowed.
(iii) All jobs are serviced on a FCFS basis.
(a) Compute Wq for each system.
(b) Determine the best and worst systems for type 1 jobs, and type 2 jobs.