Consider the following 5 processes which are labelled as A, B, C, D and E. Process Arrival Time CPU Cycle Priority A 0 5 3 B 1 2 2 C 4 1 5 D 5 4 1 E 5 2 4 List of processes You are required to draw a timeline Gantt Chart for each of the following CPU scheduling algorithms. Calculate the average turnaround time and average waiting time for each of the scheduling algorithm respectively.
Consider the following 5 processes which are labelled as A, B, C, D and E.
Process Arrival Time CPU Cycle Priority
A 0 5 3
B 1 2 2
C 4 1 5
D 5 4 1
E 5 2 4
List of processes
You are required to draw a timeline Gantt Chart for each of the following CPU scheduling
algorithms. Calculate the average turnaround time and average waiting time for each of the
scheduling
(Note: Assume that larger priority number implies a higher priority)
(i) Shortest Remaining Time First (SRTF), Round Robin (assume that time quantum in 3 time slices) and Preemptive Priority (4 marks).
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
