Consider the following set of processes, with the length of the CPU burst given in milliseconds: TTT Process Burst Time Priority 2 2 P2 P3 P4 P5 1 1 8 4 4 2 5 3 The processes are assumed to have arrived in the order P, P2, P3, P4, P5, all at time 0.

Consider a system with only two types of machine language instructions Aand B, with CPI A = 4 and CPI B = 8. Suppose that through a hardware modification CPI Acould be deceased to 2, without any change to CPI B , at the cost of increasing the clockcycle time by 20%. For what range of values of the fraction f A of executed instructionsof type A would the program execution time decrease?

Consider the following set of 5 processes, with the length of the CPU-burst time given in milliseconds arriving at time 0: P1, P2, P3, P4, and P5 with corresponding burst time: 20, 47, 13, 17 and 22.   The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Calculate average waiting time for First Come First Serve and None Preemptive Shortest Job First CPU scheduling algorithms.        b. Which of the schedules in part a results in the minimal average waiting time (over all processes)?

Draw the corresponding Gantt diagrams for this scheduling algorithms;- Round Robin q=1 (1ms Quantum).