Problem 4 (15 pts)
Suppose in the distributed system, we have 7 independent jobs $\{J1, J2, J3, J4, J5, J6, J7\}$ and 3 machines $\{M1, M2, M3\}$. The processing ability of machines are the same. The completion time of the 7 jobs are $\{2, 14, 4, 16, 6, 5, 3\}$. How to schedule them so that the entire execution time is the shortest.
(1) Please draw the scheduling order on the three machines
(2) Please calculate the shortest time of the entire execution (in other words, how long does it take run the 7 jobs on the 3 machines)
(Reference paper: Omega: flexible, scalable schedulers for large compute clusters; Large-scale cluster management at Google with Borg)
Answer:
Examples: