CPU burst given in milliseconds: Process Burst ---------- -------- P1 10 P2 4 P3 8 P4 4 P5 7 The processes are assumed to have arrived in the order P1< P2 < P3< P4< P5. A. FCFS Scheduling: (i) Draw Gantt chart that illustrates the execution of these processes using FCFS scheduling algorithm. (ii) What is the turnaround and average waiting time in part (i)? (iv) If the processes execution
change to P2< P3 < P4< P5< P1, what is the turnaround and average waiting time? (iv) If the processes execution change to P3< P1 < P5< P4< P2, what is the turnaround and average waiting time? (v) Explain the optimal execution sequence from P1< P2 < P3< P4< P5 , P2< P3 < P4< P5< P1 and P3< P1 < P5< P4< P2 B. SJF Scheduling: (i) Draw Gantt chart that
illustrates the execution of these processes using SJF scheduling algorithm. (ii) What is the turnaround and average waiting time in part (i)? (iii) Explain the optimal execution sequence from P1< P2 < P3< P4< P5 , P2< P3 < P4< P5< P1 and P3< P1 < P5< P4< P2 (iv) If the processes (P1, P2, P3, P4, P5) arrival time (0, 1, 2, 3, 4); Draw Gantt chart that illustrates the execution of these processes using SJF
scheduling algorithm. What is the turnaround and average waiting time in this part. C. Priority Scheduling: If the processes (P1, P2, P3, P4, P5) priority (3, 1, 3, 4, 2); Draw Gantt chart that illustrates the execution of these processes using Priority scheduling algorithm. What is the turnaround and average waiting time in this part. D. Round Robin (RR) Scheduling: (i) Draw Gantt chart that illustrates the execution of these processes using RR scheduling algorithm, where quantum = 2 (ii) What
is the turnaround and average waiting time in part (i)? E. In this problem which of the algorithm(s) in A(ii), B(ii), C(i) and D(ii) results the optimal CPU scheduling? F. Which of the following scheduling algorithm(s) could result in starvation and why? (a) First-come, first-served (b) Shortest job first (c) Round robin and (d) Priority Answer & Explanation  <p>Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoree</p> Fusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet Unlock full access to Course Hero Explore over 16 million step-by-step answers from our library Subscribe to view answer
PLEASE ANSWER THE QUESTION CORRECTLY: Image transcription text 6. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Burst Time Priorig Pl HI 3 P2 I 1 P3 2 3 P4 I 4 P5 5 2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time t]. a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJ F, a non-preemptive priority {a smaller priority number implies a higher priority). and RR {quantum = I) scheduling. 1). Which of the schedules in part a result in the minimal average waiting time {over all processes}? ... Show moreAnswer & Explanation Solved by verified expert lestie con g gue in gue m ipsum dolor sit amet gue itur laoree gue s Unlock full access to Course Hero Explore over 16 million step-by-step answers from our library Subscribe to view answer Step-by-step explanation itur laoreet. icitur laoreet. Nam
risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, con ur laoreet. Nam |
