This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 6. Consider a closed version of the queueing system of the previous problem, shown in Figure 2. There are M jobs in the system at all times. A job uses the CPU and with probability p i , i = 1 , . . . , m is routed to the i th I/O device. The service time of a job at the CPU (or the i th I/O device) is exponentially distributed with mean 1 μ (or 1 μ i , respectively). We assume that all job service times at all queues are independent (including the times of successive visits to the CPU and I/O devices of the same job). Find the arrival rate of jobs at the CPU and the occupancy distribution of the system. Figure 2: Figure for Problem 6. Problem 7 is an optional question, those who solve it will get extra credits. 7. Solve 8.38 (8.38) from textbook. Note : 8.8 (8.7) implies problem 8.8 from the ninth edition which is the same as 8.7 in the eighth edition. 2...
View Full Document
This note was uploaded on 08/05/2009 for the course EE 465 taught by Professor Chow during the Fall '04 term at USC.
- Fall '04