Consider the following set of processes, with the length of the CPU-burst time given in milliseconds.

Assume an algorithm takes 7.4 seconds to execute on a single 3.5 GHz processor. 49% of the algorithm is sequential. Assume that there is zero latency and that the remaining code exhibits perfect parallelism. How long (in seconds) should the algorithm take to execute on a parallel machine made of 4 3.5 GHz processors? Round answers to one decimal place (e.g. for an answer of 17.214 seconds, you would enter 17.2).

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)?