Abstract
We present an optimal primal-dual algorithm for the energy minimization preemptive open-shop problem in the speed-scaling setting. Our algorithm uses the approach of Devanur et al. [JACM 2008], by applying the primal-dual method in the setting of convex programs and KKT conditions. We prove that our algorithm converges and that it returns an optimal solution, but we were unable to prove that it converges in polynomial time. For this reason, we conducted a series of experiments showing that the number of iterations of our algorithm increases linearly with the number of jobs, n, when n is greater than the number of machines, m. We also compared the speed of our method with respect to the time spent by a commercial solver to directly solve the corresponding convex program. The computational results give evidence that for n > m, our algorithm is clearly faster. However, for the special family of instances where n = m, our method is slower.
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. Communications of ACM 53, 86–96 (2010)
Albers, S.: Algorithms for dynamic speed scaling. In: STACS 2011, pp. 1–11 (2011)
Bampis, E., Letsios, D., Lucarelli, G.: Green scheduling, flows and matchings. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 106–115. Springer, Heidelberg (2012)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge Un. Press (2004)
Brucker, P.: Scheduling algorithms, 4th edn. Springer (2004)
Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.: Market equilibrium via a primal-dual algorithm for a convex program. Journal of the ACM 55(5) (2008)
Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards, Section B 69, 125–130 (1965)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems, ch. 4, pp. 144–191. PWS Publishing Company (1997)
Gonzalez, T.: A note on open shop preemptive schedules. IEEE Transactions on Computers C-28, 782–786 (1979)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics 5, 287–326 (1979)
Gupta, A., Krishnaswamy, R., Pruhs, K.: Online primal-dual for non-linear optimization with applications to speed scaling. CoRR, abs/1109.5931 (2011)
Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)
Vazirani, V.V.: Approximation algorithms, ch. 12. Springer (2001)
Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS 1995, pp. 374–382 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Chau, V., Letsios, D., Lucarelli, G., Milis, I. (2013). Energy Minimization via a Primal-Dual Algorithm for a Convex Program. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)