Computer Science/Discrete Mathematics Seminar I
Scalably Scheduling Processes with Arbitrary Speedup Curves
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.
Date & Time
November 17, 2008 | 11:15am – 12:15pm
Location
S-101Speakers
Jeff Edmonds
Affiliation
York University, Toronto, Ont., Canada