HomeworkLib
Question

Process Scheduling Create diagram and calculating wait time for FIFO

Arrival Time Service Time Using FIFO calculate the average wait time and create the schedule that shows the results in a Gantt Chart

Gantt chart example

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 - 7 - 9 - 14 - 20 - 24

P4 - P2 - P5 - P1 - P3

Waiting time = Time at which it got picked up - arrival time

P1's waiting time = 14-7 = 7

P2's waiting time = 7-4 = 3

P3's waiting time = 20-8 = 12

P4's waiting time = 0

P5's waiting time = 9-5 = 4

Total waiting time = (7+3+12+0+4) = 26.

Average waiting ti,e = 26/5 = 5.2.

0 0
Add a comment
Know the answer?
Add Answer to:
Process Scheduling Create diagram and calculating wait time for FIFO Gantt chart example Arrival Time Service...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

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. Use the following data to draw a Gantt chart for FCFS scheduling, SJF scheduling and...

    1. Use the following data to draw a Gantt chart for FCFS scheduling, SJF scheduling and RR scheduling with time quantum 9. Show the wait time for each job and the average wait time. Process                Burst time P1                         10 P2                         5 P3                         20 P4                         15 P5                         10

  • From the Gantt chart, the waiting time and the turnaround time are calculated as:

    Round Robin Schedulin ProcessBurst Time in MsP14P22P32Calculate the average waiting time and turnaround time using round robin scheduling, where the time quantum q = 2 ms According to the Round Robin algorithm, the arrival of processes is shown in the following Gantt chart. From the Gantt chart, the waiting time and the turnaround time are calculated as: Waiting time for P1= Waiting time for P2 = Waiting time for P2 = Therefore, the average waiting time = Turnaround time =

  • CPU scheduling Process Arrival Time Burst Time Priority P1 0 8 8 P2 0 4 10...

    CPU scheduling Process Arrival Time Burst Time Priority P1 0 8 8 P2 0 4 10 P3 4 1 6 P4 6 6 8 For Shortest Remaining Time draw the Gantt chart to illustrate how these processes would be scheduled, and calculate turnaround time per process and the wait time per process.

  •          Process                    Arrival Time            &nbsp

             Process                    Arrival Time                             Burst Time                         P1                                0                                              2                         P2                                1                                              1                         P3                                2                                              4                         P4                                3                                              2                         P5                                4                                              1 Consider a set of processes given above with the arrival time and the length of CPU burst time given in cycles. Show a Gantt chart and calculations of average turnaround time and average waiting time of these processes under the shortest job first (SJF) with preemption CPU scheduling algorithm and the round-robin...

  • 1.Make a Gantt Chart diagram that illustrates a possible issue with limited resource scheduling if the...

    1.Make a Gantt Chart diagram that illustrates a possible issue with limited resource scheduling if the resources are not available? Make up an example “what if”- some of the project team get the flu at the same time, for instance? Your diagram should illustrate how much of the resource is needed over a short period of time, that there is not enough of the resource, and possible options to keep the project as close to schedule or budget as possible....

  • 5. [27pts.] Given the following set of processes, with arrival times, priorities, and the length of...

    5. [27pts.] Given the following set of processes, with arrival times, priorities, and the length of the CPU burst in ms: Priority Burst time Arrival Time Process 3 P1 4 P2 2 10 P3 P4 (Note: a lower number means higher priority) Draw a Gantt chart showing a FCFS scheduling algorithm. a. b. Draw a Gantt chart showing a non-preemptive Priority scheduling algorithm. c. Draw a Gantt chart showing a Round Robin Scheduling algorithm with quantum of 4ms d. Compute...

  • Opearting system 5. [27pts.] Given the following set of processes, with arrival times, priorities, and the...

    Opearting system 5. [27pts.] Given the following set of processes, with arrival times, priorities, and the length of the CPU burst in ms: Process Arrival Time Burst time Priority P1 P2 P3 2 10 P4 (Note: a lower number means higher priority; processes P2- P4 arrive at the same time, in the given order) a. Draw a Gantt chart showing a FCFS scheduling algorithm. b. Draw a Gantt chart showing a non-preemptive Priority scheduling algorithm. Draw a Gantt chart showing...

  • Compute turnaround time with preemptive priority scheduling. Also compute the average turnaround time. Show the Gantt...

    Compute turnaround time with preemptive priority scheduling. Also compute the average turnaround time. Show the Gantt chart and other details. Process CPU Burst time Arrival time Priority P1 25 5 5 P2 10 10 3 P3 15 15 4 P4 20 20 2 P5 30 25 1

  • 2. Consider the following processes with the arrival time, burst time, and priority. Draw Gantt chart...

    2. Consider the following processes with the arrival time, burst time, and priority. Draw Gantt chart for a priority-based preemptive CPU scheduling algorithm (the highest number refers the highest priority, in case of same priority, follow FCFS) (4 points) Priority PIDATBT PI 0 10 P3 10 6 3

  • 6. Draw GANTT charts (plots of activity vs. time) for the Round Robin and Priority scheduling...

    6. Draw GANTT charts (plots of activity vs. time) for the Round Robin and Priority scheduling strategies for the following jobs (assume larger numbers mean higher priority and that the time quantum is 2): (10 marks ) Job Arrival Time Duration Priority tam What is the average waiting time under each scheme? Time → Average wait time for round robin is: PRIORITY Time → Average wait time for round robin is:

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