To Do or Not To Do: Scheduling to Minimize Energy

233 views · Published 27 June 2016 · 1:00:29 · Indexed 14 November 2026

Channel: Microsoft Research · 2016 · Science & Technology

Watch on YouTube

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.)

More from this channel