Consider the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds) and priorities. For example, process P1 arrives 8 milliseconds after the start of the system; process has priority (3, 1, 2, 1, 1) and needs the CPU for 12 milliseconds.
What are the average turnaround time, completion time and the average waiting time in the scheduler queue in milliseconds for this set of processes running on a system using each of the scheduling algorithms listed below? Show your work to get any or full points. And also draw the Gant Chart.
1. Round Robin scheduling algorithm (quantum = 1 millisecond).
2. Shortest Job First (non-preemptive).
Attachments:
Answers
Answered by
2
Answer:
sorry bro don't know that answer
Similar questions