To Do or Not To Do: Scheduling to Minimize Energy

Опубликовано 27 июня 2016, 22:14

Traditional scheduling algorithms, especially those involving job scheduling on parallel machines, make the assumption that the machines are always available and try to schedule jobs to minimize specific job related metrics. Since modern data centers consume massive amounts of energy, we consider job scheduling problems that take energy consumption into account, turning machines off, especially during periods of low demand. The ensuing problems relate very closely to classical covering problems such as capacitated set cover, and we discuss several recent results in this regard. (This is talk covers two papers, and is joint work with Jessica Chang, Hal Gabow and Koyel Mukherjee.)