Question: Question # 5 Suppose that a multiprogrammed system has a load of N processes with individual execution times of ti, t2, ...,tN. Answer the following

Question # 5 Suppose that a multiprogrammed system has a load of N processes with individual execution times of ti, t2, ...,tN. Answer the following questions: a) How would following a) How would it be possible that the time to complete the N processes could be as small as: maximum (ti, t2, ...tn)? b) How would it be possible that the total execution time, T>+ ...+t? In other words, what would cause the total execution time to exceed the sum of individual process execution times
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
