1. Engineering
  2. Computer Science
  3. help 1 round robin scheduling on the following process schedule...

Question: help 1 round robin scheduling on the following process schedule...

Question details

Help...

1. Round Robin scheduling on the following process schedule (assume each process comes in right after another) and state the average wait time

Hint: Do a gnatt chart for each
Hint: Assume a time quantum of 4ms

Process   Burst Time
P1 30
P2 3
P3 7

**************************************

2. Perform SJFS preemptive scheduling on the following process schedule (assume each process comes in right after another) and state the average wait time.

Hint: Do a gnatt chart for each
Hint 2: Ignore Arrival times for SJFS nonpreemptive


Process   Burst Time   Arrival
P1 6 0
P2 8 1
P3 7 2
P4 3 3

**************************************

3. Perform FCFS scheduling on the following process schedule (assume each process comes in right after another) and state the average wait time

Hint: Do a gnatt chart

Process   Burst Time
P1 24
P2 4
P3 3

**************************************

4. Perform Priority scheduling on the following process schedule (assume each process comes in right after another) and state the average wait time

Hint: Assume non-preemptive
Hint: Do a gnatt chart for each

Process   Burst Time   Priority
P1 10 3
P2 3 1
P3 2 2
P4 5 5
P5 5 4

**************************************

5. Perform FCFS scheduling on the following process schedule (assume each process comes in right after another) and state the average wait time

Hint: Do a gnatt chart

Process   Burst Time
P1 10
P2 8
P3 2
P4 1

**************************************

6. Perform SJFS nonpreemptive scheduling on the following process schedule (assume each process comes in right after another) and state the average wait time.

Hint: Do a gnatt chart for each
Hint 2: Ignore Arrival times for SJFS nonpreemptive


Process   Burst Time   Arrival
P1 12 0
P2 8 1
P3 5 2
P4 3 3

to use Ginger
Limited mode
P1, 12
×
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution