Question 3.76

1. Find the completion time for independent tasks of length 8, 11, 17, 14, 16, 9, 2, 1, 18, 5, 3, 7, 6, 2, 1 on two processors, using the list-processing algorithm.
2. Find the completion time for the tasks in part (a) on two processors, using the decreasing-time-list algorithm.
3. Does either algorithm give rise to an optimal schedule?
4. Repeat for tasks of lengths 19, 19, 20, 20, 1, 1, 2, 2, 3, 3, 5, 5, 11, 11, 17, 18, 18, 17, 2, 16, 16, 2.