Scalably Scheduling Processes with Arbitrary Speedup Curves

COMPUTER SCIENCE/DISCRETE MATH I
Topic:Scalably Scheduling Processes with Arbitrary Speedup Curves
Speaker:Jeff Edmonds
Affiliation:York University, Toronto, Ont., Canada
Date:Monday, November 17
Time/Room:11:15am - 12:15pm/S-101

We give a (1+eps)-speed Theta(1/eps^2)-competitive nonclairvoyant algorithm for scheduling jobs with sublinear nondecreasing speed-up curves on multiple processors with the objective of total response time.