Question: Suppose that L is the minimum makespan when p processors are given n jobs, where tj is the time required to run job j. a)
a) Show that L∗ ≥ max j = 1,2,...,n tj.
b) Show that L∗ ≥ 1/p Σnj=1 tj.
Step by Step Solution
3.41 Rating (154 Votes )
There are 3 Steps involved in it
a The makespan is always at least as large as the load on ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
923-M-C-M-S (1602).docx
120 KBs Word File
