Abstract
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 L p -norm objective.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albers, S.: Energy-efficient algorithms. Comm. of the ACM 53(5), 86–96 (2010)
Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC 2005, pp. 331–337 (2005)
Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54, 1 (2007)
Bartal, Y., Leonardi, S., Shallom, G., Sitters, R.: On the Value of Preemption in Scheduling. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 39–48. Springer, Heidelberg (2006)
Braun, O., Schmid, G.: Parallel processor scheduling with limited number of preemptions. SIAM J. Computing 32, 671–680 (2003)
Brooks, D.M., Bose, P., Schuster, S.E., Jacobson, H., Kudva, P.N., Buyuktosunoglu, A., Wellman, J.-D., Zyuban, V., Gupta, M., Cook, P.W.: Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro 20(6), 26–44 (2000)
Chen, J.-J., Kuo, T.-W., Lu, H.-I.: Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 338–349. Springer, Heidelberg (2005)
Chuzhoy, J., Codenotti, P.: Resource Minimization Job Scheduling. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 70–83. Springer, Heidelberg (2009)
Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problems. Math. Oper. Res. 31(4), 730–738 (2006)
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)
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)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-Completeness. W.H. Freeman (1979)
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)
Li, M., Liu, B.J., Yao, F.F.: Min-energy voltage allocation for tree-structured tasks. J. Combinatorial Optimization 11, 305–319 (2006)
Li, M., Yao, F.F.: An efficient algorithm for computing optimal discrete voltage schedules. SIAM J. on Computing 35, 658–671 (2005)
Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS 1995, 374-382 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antoniadis, A., Huang, CC. (2012). Non-preemptive Speed Scaling. In: Fomin, F.V., Kaski, P. (eds) Algorithm Theory – SWAT 2012. SWAT 2012. Lecture Notes in Computer Science, vol 7357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31155-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-31155-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31154-3
Online ISBN: 978-3-642-31155-0
eBook Packages: Computer ScienceComputer Science (R0)