Operating systems

Scheduling chapter 5

Book: operating systems concepts

Author Abraham

Operating Systems (Scheduling) NOTE: Please provide a hand written solution. A soft copy or computer printed version will not be accepted Q1 Consider the following set of processes, with the length of CPU burst given in milliseconds: Process Burst time Prierity The processes are assumed to have arrived in the order P1, P2, P3, and P4 all at time 0. a. Draw the Gantt chart that illustrates the execution of these processes suing FCFS, SJF, Priority and round robin (quantum-4) scheduling algorithm in part a? time? b. What is the waiting time of each process for each of the c. Which of the algorithm results in minimum average wait Q2 Consider the following set of processes, with the length of CPU burst given in milliseconds: PI P2 P4 a. Draw the Gantt chart that illustrates the execution of these processes using Non-Preemptive SJF and Preemptive SJF (i.e. shortest remaining time first) algorithms scheduling algorithm in part a? time? b. What is the waiting time of each process for each of the c. Which of the algorithm results in minimum average wait