Professor Jones takes some measurements of his (deterministic) Multithreaded program, which is scheduled using a greedy scheduler, and finds thatT4=80 seconds andT64=10 seconds. What is the fastest...

Professor Jones takes some measurements of his (deterministic)

Multithreaded program, which is scheduled using a greedy scheduler, and finds thatT4=80 seconds andT64=10 seconds. What is the fastest that the professor’s computation could possibly run on 10 processors? Use the following inequalities and the bounds implied by them to derive your answer (P is the number of processors):

where the last inequality holds on a greedy scheduler.