Consider the following set of processes, with the length of the CPU burst time given in milliseconds:
Question Get Answer

Consider the following set of processes, with the length of the CPU burst time given in milliseconds:

Process

Burst Time

Priority

P1

2

2

P2

1

1

P3

8

4

P4

4

3

P5

5

2


The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.


  1. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 2).


  1. What is the waiting time of each process for each of these scheduling algorithms?


  1. What is the turnaround time of each process for each of the scheduling algorithms in part a?


  1. Which of the algorithms results in the minimum average waiting
  2. time (over all processes)?

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Let our 24/7 Operations Management tutors help you get unstuck! Ask your first question.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes