CS 3150
Topics in Algorithms
The topic
for Spring 2010 is Algorithmic Power Management
Instructor
Email: kirk@cs.pitt.edu
Phone : 412-624-8844
The course
will meet MWF 2:20-3:50 when I am not traveling to academic
conferences. The first class will be Wednesday January 6. In total we
will meet between 25 and 30 times.
Course Description
This will be a reading course covering recent literature on power management. The exact nature of the papers covered will be dictated in part by student interests. But as a default, I expect that approximately the first 1/3 or 1/4 of the course will consist of the instructor presenting recent papers from the algorithmic literature. Currently the range of the power management problems considered in the algorithmic literature is arguably somewhat narrow. During this first portion of the course, the students will be asked to help search the computer systems literature for interesting and relevent papers on power management, with a bias toward papers that discuss potentially algorithmically interesting issues. During the second portion of the course, the students will present these papers. One of the goals of these presentations is to get a broad picture of the state of current research on power management. Another goal of the presenations, and class discussions, is to identify algorithmically interesting problems that arise in some area of application. At the end of the course, the students may be asked to write a short (1-3 page) paper that tries to fully formulate/formalize an algorithmically interesting problem suggested by one of the papers from the computer systems literature.
In Spring 2009, I organized a NSF Workshop on the Science of Power Management. The final report summarizes the importance of developing a science of power management. Speaker slides can be found here.