Fwd: Talk announcement

[Chien-Chung Huang]

Dear Students who have taken the algorithm course, 

Below is a talk announcement. 

Chien-Chung

Begin forwarded message:

From: chien-chung huang <hua...@chalmers.se>

Subject: Talk announcement

Date: November 27, 2014 2:55:07 PM GMT+01:00

To: CSE Collection list <all...@chalmers.se>

Cc: CSE LAB <lab...@chalmers.se>

Dear Colleagues, 

Sebastian Ott 

http://people.mpi-inf.mpg.de/~ott/

is my Ph.D. student at Max-Planck-Institute für Informatik. He will visit us for one week. His office will be room 6476. 

He works on energy-efficient algorithms, particularly in the context of machine scheduling. He will present his talk next Monday, 1PM (the talk is about 35 minutes long), in room 8103. 

I attach the title and the abstract below. 

Chien-Chung

Title: Non-Preemptive Speed Scaling
Abstract: 
"Speed scaling is a widely applied technique for energy saving in modern microprocessors. Its general idea is to strategically adjust the processing speed, such that a number of given tasks (each equipped with a release time, deadline and processing volume) are finished completely using as little energy as possible. We consider the non-preemptive version of the problem, where every job, once started, must be processed uninterruptedly until its completion. Since the problem is known to be strongly NP-hard, we are interested in efficient algorithms with provable approximation guarantee. In the talk, I will give a general introduction to this area of energy-efficient scheduling and then present some of our recent results for the above mentioned problem."