Campus Event Calendar
Event Entry
What and Who
New Results for Non-Preemptive Speed Scaling
Sebastian Ott
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 23 September 2014
13:00
30 Minutes
E1 4
022
Saarbrücken
Warning: New Room!
Abstract
We consider the speed scaling problem, where a number of jobs, each with its own processing volume, release time, and deadline, needs to be executed on a single speed-scalable processor. The power consumption of this processor is P(s) = s^α, where s is the processing speed, and α > 1 is a constant. Our goal is to feasibly process all jobs, while minimizing the total energy consumption.
The preemptive version of the problem, along with its many variants, has been extensively studied over the years. However, little is known about the non-preemptive version of the problem, except that it is strongly NP-hard and allows a (large) constant factor approximation. Up until now, the (general) complexity of this problem is unknown. We study an important special case of the problem, where the job intervals form a laminar family, and present a quasipolynomial-time approximation scheme for it. Furthermore, we show that the special case of equal-volume jobs can be solved in polynomial-time.
Contact
Sebastian Ott
--email hidden
passcode not visible
logged in users only
Sebastian Ott, 09/16/2014 10:30
Sebastian Ott, 09/15/2014 15:38 -- Created document.
Sebastian Ott, 09/15/2014 15:38 -- Created document.