Question

Consider three jobs – A, B, and C, with running times of 50 seconds, 30 seconds,...

Consider three jobs – A, B, and C, with running times of 50
seconds, 30 seconds, and 70 seconds respectively. Assume context switching is
instantaneous.
a) Assume all jobs arrive at the same time, in the order A, then B, and then C. With respect
to FIFO, what is the average turnaround time and the average first-response time?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Ans

Average Response Time = 43.3 s

Average Turnaround Time = 93.3 s

In FIFO, processor is assigned according to their order.

Turnaround time = Time at which execution got completed - Arrival Time

Response Time is the time required to get the processor after arrival of process for the first time

= Time at processor assigned first time - Arrival time

Running Time of A = 50 seconds

After 50 seconds, execution of A completes

Turnaround Time of A = 50 s

At t=0, it gets the processor

Response Time of A = 0 s

After A, B starts executing

Running time of B = 30 second

After 30 seconds i.e at Time t = 50+30 = 80sec

Execution of B got completed.

Turnaround Time of B = 80 sec

B gets processor at t = 50 s

Response Time of B = 50 sec

Process C start executing at t = 80s

Execution Time = 70 s

After 70 s process gets completed, i.e at Time T = 80+70 = 150 s

It get completed at t = 150s

Turnaround Time = 150 s

It get processor at t = 80s

Response Time = 80 s

Average Turnaround Time = Sum of Turnaround Time/3

=(50+80+150)/3

= 280/3

= 93.3 s

Average Response Time = Sum of response Time / 3

= (0 + 50 + 80)/3

= 130/3

= 43.3s

If any doubt ask in the comments

Add a comment
Know the answer?
Add Answer to:
Consider three jobs – A, B, and C, with running times of 50 seconds, 30 seconds,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 1. Compute the response time and turnaround time when running three jobs of length 200 with...

    1. Compute the response time and turnaround time when running three jobs of length 200 with the SJF and FIFO schedulers. 2. Now do the same but with jobs of different lengths: 100, 200, and 300. 3. Now do the same, but also with the RR scheduler and a time-slice of 1.

  • Five batch jobs, A through E, arrive in alphabetical order at a computer at almost the...

    Five batch jobs, A through E, arrive in alphabetical order at a computer at almost the same time (i.e. they all arrive before the next scheduling event occurs). They have estimated running times of 500, 300, 600, 700, and 200 ms, respectively. Using diagrams, show how the process scheduling algorithms below would schedule these jobs, and calculate the mean process turnaround time (assuming no process switching overhead): FCFS SPN RR with a quantum of 100ms RR with a quantum of...

  • 31. (12pts) Four processes pi, P2, Ps and pa arrive in the ready queue at times 0,3,8,11 and ks r...

    31. (12pts) Four processes pi, P2, Ps and pa arrive in the ready queue at times 0,3,8,11 and ks respectively. Draw the Gantt chart their running timcs arc 18,13,11, and 14 clock tic for the system and compute the average response and waiting time for the following algorithms. Ignore process switching time (a) Round Robin (quantum 10) (b) Shortest Job First (c) Preemptive Shortest Job First 31. (12pts) Four processes pi, P2, Ps and pa arrive in the ready queue...

  • Design Principles Canvas Ā 8 pts Question 35 Five batch jobs, A, B, C, D, and...

    Design Principles Canvas Ā 8 pts Question 35 Five batch jobs, A, B, C, D, and E, arrive at a computer system at time 0, 1, 2, 3, 4, respectively. And they have service time of 7.1. 3,5, and 4, respectively. The new jobs arrive a little ahead of the expiration of time slices. For each of the following scheduling algorithms, determine the turnaround time for each process for all jobs. Ignore process switching overhead. • Round robin with a...

  • We have two jobs A and B. The execution pattern for A is CPU first IO...

    We have two jobs A and B. The execution pattern for A is CPU first IO next, and of B IO first CPU next. Each one needs CPU time of 40mn. The IO time of A is 50% of total execution time of A. Likewise for B. Ignore context switch time or initial program load time (assume that it is zero). Total execution time is defined to be CPU time plus IO time. The unit mn stands for minute. (a)...

  • (30 points) Assume you have three processes with the following attributes running on a single CPU...

    (30 points) Assume you have three processes with the following attributes running on a single CPU (uniprocessor system): Process 1/0 Burst Total CPU Time Arrival Time CPU Burst | 05 22 12 B 7 10 C D Create three scheduling simulations for these processes using the following algorithms: a. First Come First Served (FCFS) b. Round Robin, Time Slice = 2 c. Shortest Job (CPU Burst Time) First with NO Preemption Use the simulation format we covered in class to...

  • Five batch jobs (A,D,I,J,K) arrive at a computer at the same time(at time=0). The quantum size...

    Five batch jobs (A,D,I,J,K) arrive at a computer at the same time(at time=0). The quantum size of this system is 2 units of time. For each of the scheduling methods given below, calculate the average waiting time for the 5 jobs. Show (use timing diagrams) and explain your steps. You can prepare it by hand or on a computer. The following jobs and the estimated running times are defined: A 2 B 6 C 4 D 8 E 2 F...

  • Question 4 [Points 4] Consider a system running 2 (two)CPU-bound tasks (C1-C2) and 1(one) I/O-bound tasks(I1). I/O bound...

    Question 4 [Points 4] Consider a system running 2 (two)CPU-bound tasks (C1-C2) and 1(one) I/O-bound tasks(I1). I/O bound task issues an I/O operation once every 1millisecond ofCPU. Each I/O operation takes 10milliseconds. Assume that there is only one I/O device (so multiple I/O requests may have to queue). Assume that the context switch takes 1 millisecond. Assume that each CPU-bound requires 20 milliseconds of CPU to complete and each I/O-bound task requires 2millisecondof CPU time. Show through a Ganttt chart...

  • i Running Times (in seconds) Country Heat <MUWLUI-YEZ Name Runner 1 Runner 2 Runner 3 Runner...

    i Running Times (in seconds) Country Heat <MUWLUI-YEZ Name Runner 1 Runner 2 Runner 3 Runner 4 Runner 5 Runner 6 Runner 7 Runner 8 Runner 9 Runner 10 Runner 11 Runner 12 Runner 13 Runner 14 con uno o o oNNNNNNN Time 51.13 51.94 52.02 52.03 52.45 52.84 54.59 51.49 51.82 51.96 51.98 52.24 52.69 53.71 Print Done In a certain running event, preliminary heats are determined by random draw, so it would be expected that the abilities of...

  • a) Using the FCFS​ (first come, first served​ ) decision rule for sequencing the​ jobs, the...

    a) Using the FCFS​ (first come, first served​ ) decision rule for sequencing the​ jobs, the order is​ (assume that jobs came in the order in which they are listed in the​ table): Sequence Job 1 A 2 B 3 C 4 D 5 E The average tardiness​ (job lateness) for the sequence developed using the FCFS rule​ = ___ days ​(round your response to two decimal​ places). The following jobs are waiting to be processed at the same machine...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT