[Solved]Given Following Set Processes Corresponding Execution Times Ms Arrival Times Priority 1 Hi Q37139856
Given the following set of processes with correspondingexecution times (in ms), arrival times and priority (1 – highest).For each scheduling algorithm: a. Construct a table showing whichprocess is active and for how long until all processes arecompletely serviced (as done in class). b. Calculate the averagewaiting time and turnaround time.
Process ID
Burst (ms)
Arrival time
P1
9
0
P2
12
0
P3
3
0
P4
30
0
P5
20
0
P6
10
0
- First Come First Serve (FCFS)
- Shortest-job first (SJF non pre-emptive)
Process ID
Burst (ms)
Arrival time
Priority
P1
9
0
2
P2
12
5
1
P3
3
9
1
P4
30
25
2
P5
20
25
2
P6
2
45
1
- Shortest-job first (SJF non pre-emptive)
- Shortest-remaining time next (SJF pre-emptive)
- Round-robin (RR with 3 ms quantum)
- Priority-based scheduling (with shortest job first)
Expert Answer
Answer to Given the following set of processes with corresponding execution times (in ms), arrival times and priority (1 – highe… . . .
OR
