This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Scheduling and Admission Control
Bunde, David Pattison
Doctoral Committee Chair(s)
Department of Study
Degree Granting Institution
University of Illinois at Urbana-Champaign
Our third problem is power-aware scheduling, where the processor can run at different speeds, with its energy consumption depending on the speeds selected. If schedule quality is measured with makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem when every job requires the same amount of work. We also show that the multiprocessor problem becomes NP-hard when jobs can require different amounts of work. If schedule quality is measured with total flow time, we show that finding the optimal schedule for a particular energy budget is impossible. We do, however, give an arbitrarily-good approximation for scheduling equal-work jobs on a multiprocessor.