3- Consider the following set of processes, with the given CPU cycle duration in ms: Process...

Transcribed Image Text:

3- Consider the following set of processes, with the given CPU cycle duration in ms: Process P1 Cycle duration 4 P2 5 P3 3 P4 P5 7 2 Priority 3 1 4 3 2 It is assumed that the processes arrived in order P1, P2, P3, P4, P5 at time 0. a- Draw four Gantt charts illustrating the execution of these processes scheduling algorithms using the FCFS (first come first served), SJF (short job first), a priority without requisition (smaller number indicates higher priority) and RR (round robin with quantum is 2). b- What is the average time to treat a process for each of the scheduling algorithms? c- What is the average process wait time for each of the scheduling algorithms? 3- Consider the following set of processes, with the given CPU cycle duration in ms: Process P1 Cycle duration 4 P2 5 P3 3 P4 P5 7 2 Priority 3 1 4 3 2 It is assumed that the processes arrived in order P1, P2, P3, P4, P5 at time 0. a- Draw four Gantt charts illustrating the execution of these processes scheduling algorithms using the FCFS (first come first served), SJF (short job first), a priority without requisition (smaller number indicates higher priority) and RR (round robin with quantum is 2). b- What is the average time to treat a process for each of the scheduling algorithms? c- What is the average process wait time for each of the scheduling algorithms?

Answer rating: 100% (QA)

a Gantt charts FCFS First Come First Served P1P2P3P4P50 4 9 12 19 21 SJF Shortest Job First P5P3P1P2P40 2 5 9 14 21 Priority Smaller number indicates ... View the full answer