Question
Q2 (20 marks): Consider the following set of processes, with the length of CPU burst given in milliseconds: Process Burst time Arrival Time P1 8
Q2 (20 marks): Consider the following set of processes, with the length of CPU burst given in milliseconds:
| Process | Burst time | Arrival Time |
| P1 | 8 | 0 |
| P2 | 5 | 2 |
| P3 | 2 | 9 |
| P4 | 2 | 10 |
-
Draw the Gantt chart that illustrates the execution of these processes using Non-Preemptive SJF and Preemptive SJF (i.e. shortest remaining time first) algorithms
b. What is the average wait time of each of the scheduling algorithms in part a?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Database Technology And Management Computers And Information Processing Systems For Business
Authors: Robert C. Goldstein
1st Edition
0471887374, 978-0471887379
