Abstract
We consider a strategic game, where players submit jobs to a machine that executes all jobs in a way that minimizes energy while respecting the jobs’ deadlines. The energy consumption is then charged to the players in some way. Each player wants to minimize the sum of that charge and of their job’s deadline multiplied by a priority weight. Two charging schemes are studied, the proportional cost share which does not always admit pure Nash equilibria, and the marginal cost share, which does always admit pure Nash equilibria, at the price of overcharging by a constant factor.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Albers, S.: Energy-efficient algorithms. Communications of the ACM 53(5), 86–96 (2010)
Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms (TALG) 3(4), 49 (2007)
Angel, E., Bampis, E., Kacem, F.: Energy aware scheduling for unrelated parallel machines. In: 2012 IEEE International Conference on Green Computing and Communications (GreenCom), pp. 533–540. IEEE (2012)
Bansal, N., Chan, H.-L., Katz, D., Pruhs, K.: Improved bounds for speed scaling in devices obeying the cube-root rule. Theory of Computing 8, 209–229 (2012)
Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. Journal of the ACM (JACM) 54(1), 3 (2007)
Brooks, D.M., Bose, P., Schuster, S.E., Jacobson, H., Kudva, P.N., Buyuktosunoglu, A., Wellman, J., 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)
Carrasco, R.A., Iyengar, G., Stein, C.: Energy aware scheduling for weighted completion time and weighted tardiness. Technical report, arxiv.org (2011)
Chan, S.-H., Lam, T.-W., Lee, L.-K.: Non-clairvoyant speed scaling for weighted flow time. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 23–35. Springer, Heidelberg (2010)
Irani, S., Pruhs, K.R.: Algorithmic problems in power management. ACM SIGACT News 36(2), 63–76 (2005)
Li, M.G., Yao, A.C., Yao, F.F.: Discrete and continuous min-energy schedules for variable voltage processor. Proceedings of the National Academy of Sciences of the United States of America, PNAS 2006 103, 3983–3987 (2006)
Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 745–756. Springer, Heidelberg (2013)
Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14, 124–143 (1996)
Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory 18(3), 511–533 (2001)
Pruhs, K., Uthaisombut, P., Woeginger, G.: Getting the best response for your erg. ACM Transactions on Algorithms (TALG) 4(3), 38 (2008)
Vasquez, O.C.: Energy in computing systems with speed scaling: optimization and mechanisms design. Technical report, arxiv.org (2012)
Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced cpu energy. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS 1995, pp. 374–382. IEEE Computer Society, Washington, DC (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
Dürr, C., Jeż, Ł., Vásquez, Ó.C. (2013). Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling. In: Chen, Y., Immorlica, N. (eds) Web and Internet Economics. WINE 2013. Lecture Notes in Computer Science, vol 8289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45046-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-45046-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45045-7
Online ISBN: 978-3-642-45046-4
eBook Packages: Computer ScienceComputer Science (R0)