Question: Five batch jobs. A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2,

Five batch jobs. A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4, and 8 minutes. Their (externally determined) priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the mean process turnaround time. Ignore process switching overhead.
(a) Round robin.
(b) Priority scheduling.
(c) First-come, first-served (run in order 10, 6, 2, 4, 8).
(d) Shortest job first.
For (a), assume that the system is multi programmed, and that each job gets its fair share of the CPU. For (b) through (d), assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.

Step by Step Solution

★★★★★

3.41 Rating (173 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

For round robin during the first 10 minutes each job gets 15 of the CPU ... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Document Format (1 attachment)

761-C-S-D-B-O-S (317).docx

120 KBs Word File

Students Have Also Explored These Related Operating System Questions!

Assume that your system is using JDK 1.2. Show the rules (similar to those in Figure 9-40) you will use to allow an applet from www.appletsRus.com to run on your machine. This applet may download...

Assume that at time 5 no system resources are being used except for the processor and memory. Now consider the following events: At time 5: P1 executes a command to read from disk unit 3. At time 15:...

A certain chemical process is run 10 times at a temperature of 65¦C and 10 times at a temperature of 80¦C. The yield at each run was measured as a percent of a theoretical maximum. The...

Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 6, 4, 8, 2, 10 minutes. For Round Robin scheduling algorithm, determine the mean...

Five batch jobs. A through E, arrive at a computer center at almost the same time. They have estimated running times of 14, 8, 2, 4, and 10 minutes. Their (externally determined) priorities are 3, 5,...

operating systems: Question 1: What is multiprogramming? What is timesharing? Question 2: Which of the following instructions should be allowed only in kernel mode? (a) Set the time-of-day clock. (b)...

Q9 (Modified Problem 45). Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 4, 2, 6, and 8 minutes. Their (externally...

please look at the set 4 Five batch jobs. A through E, arrive at a computer center at almost the same time. They have estimated running times of T1, T2, T3, T4, and T5 minutes. Their (externally...

Please solve with full explaination: Five batch jobs A through E , arrive at a computer center at almost the same time. They have estimated running times of 1 0 , 4 , 2 , 6 , and 8 minutes. Their (...

Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 9, 2, 5, and 3 minutes. Their externally determined priorities are 3, 5, 2,...

The insertion loss of a filter circuit can be calculated in terms of its A, B, C and D parameters when terminated by Zg and ZL as shown in Figure. Show that |AZ + B + CZZ + DZ, Z, + ZL IL = 20 log10...

Perform the same computation as in Sec. 12, but for the truss depicted inFigure. 600 1200 30 45 45% 500

The level of return or compensation that you might expect for assuming the risks associated with investing in a business is referred to as Multiple choice question. gross margin. evaluation. profit...

If f is even, then f 9 is even. Determine whether the statement is true or false. If it is true, explain why. If it is false, explain why or give an example that disproves the statement.

Consider the following processes P1 and P2 that update the value of the shared variables, x and y, as follows: Assume that the initial values of x and y are 2 and 3 respectively. P1 enters the system...

In 1978, Dijkstra put forward the conjecture that there was no solution to the mutual exclusion problem avoiding starvation, applicable to an unknown but finite number of processes, using a finite...

Consider the following program: a. Determine the proper lower bound and upper bound on the final value of the shared variable tally output by this concurrent program. Assume processes can execute at...

A project will reduce costs by $ 3 5 , 5 0 0 but increase depreciation by $ 1 6 , 3 0 0 . What is the operating cash flow if the tax rate is 2 1 percent? Multiple Choice $ 2 0 , 7 2 0 $ 3 1 , 0 8 0 $...

Let f(x 1 ,x 2 ,x 3 )=exp[(x 1 + x 2 + x 3 )], 0