Non-preemptive Speed Scaling
We consider the following variant of the speed scaling problem introduced by Yao, Demers, and Shenker. We are given a set of jobs and we have a variable-speed processor to process them. The higher the processor speed, the higher the energy consumption. Each job is associated with its own release time, deadline, and processing volume. The objective is to find a feasible schedule that minimizes the energy consumption. Moreover, no preemption of jobs is allowed.
Unlike the preemptive version that is known to be in P, the non-preemptive version of speed scaling is strongly NP-hard. In this work, we present a constant factor approximation algorithm for it. The main technical idea is to transform the problem into the unrelated machine scheduling problem with Lp-norm objective.
Unable to display preview. Download preview PDF.
- 2.Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC 2005, pp. 331–337 (2005)Google Scholar
- 10.Dimpsey, R.T., Iyer, R.K.: Performance degradation due to multiprogramming and system overheads in real workloads: Case study on a shared memory multiprocessor. In: International Conference on Supercomputing 1990, pp. 227–238 (1990)Google Scholar
- 11.Etsion, Y., Tsafrir, D., Feitelson, D.G.: Effects of clock resolution on the scheduling of interactive and soft real-time processes. In: SIGMETRICS 1990, pp. 172–183 (1990)Google Scholar
- 12.Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-Completeness. W.H. Freeman (1979)Google Scholar
- 13.Natarajan, C., Sharma, S., Iyer, R.K.: Measurement-based characterization of global memory and network connection, operating system and parallelization overheads: Case study on a shared memory multiprocessor. In: Annual International Symposium on Computer Architecture, vol. 21, pp. 71–80 (1994)Google Scholar
- 16.Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS 1995, 374-382 (1995)Google Scholar