Prove that the algorithm from Exercise 44 is a 2-
Chapter 3, Problem 46E(choose chapter or problem)
Prove that the algorithm from Exercise 44 is a 2- approximation algorithm for the load balancing problem. [Hint: Use both parts of Exercise 43.]Exercise 44: Write out in pseudo code the greedy algorithm that goes through the jobs in order and assign each job to the processor with the smallest load at that point in the algorithm.Exercise 43: Suppose that L* is the minimum makespan when p processors are given n jobs, where tj is the time required to run job j.1. Show that L* maxj = 1,2,….,n tj2. Show that L*
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer