{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T21:10:03Z","timestamp":1745356203717,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_17","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T09:00:11Z","timestamp":1353920411000},"page":"234-247","source":"Crossref","is-referenced-by-count":0,"title":["Slow Down and Sleep for Profit in Online Deadline Scheduling"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Cord-Landwehr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Mallmann-Trenn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Albers, S.: Algorithms for Dynamic Speed Scaling. In: Proc. of the 28th International Symp. On Theoretical Aspects of Computer Science (STACS), Schloss Dagstuhl, pp. 1\u201311 (2011)"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S. Albers","year":"2010","unstructured":"Albers, S.: Energy-Effcient Algorithms. Comm. of the ACM\u00a053(5), 86\u201396 (2010)","journal-title":"Comm. of the ACM"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S., Antoniadis, A.: Race to Idle: New Algorithms for Speed Scaling with a Sleep State. In: Proceedings of the 23rd Symposium on Discrete Algorithms, SODA (2012)","DOI":"10.1137\/1.9781611973099.100"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Albers, S., Antoniadis, A., Greiner, G.: On Multi-Processor Speed Scaling with Migration. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 279\u2013288. ACM (2011)","DOI":"10.1145\/1989493.1989539"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-02927-1_14","volume-title":"Automata, Languages and Programming","author":"N. Bansal","year":"2009","unstructured":"Bansal, N., Chan, H.-L., Pruhs, K., Katz, D.: Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 144\u2013155. Springer, Heidelberg (2009)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-70575-8_34","volume-title":"Automata, Languages and Programming","author":"N. Bansal","year":"2008","unstructured":"Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: Scheduling for Speed Bounded Processors. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 409\u2013420. Springer, Heidelberg (2008)"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206035.1206038","volume":"54","author":"N. Bansal","year":"2007","unstructured":"Bansal, N., Kimbrel, T., Pruhs, K.: Speed Scaling to Manage Energy and Temperature. Journal of the ACM\u00a054(1), 1\u201339 (2007)","journal-title":"Journal of the ACM"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Baptiste, P.: Scheduling Unit Tasks to Minimize the Number of Idle Periods: A Polynomial Time Algorithm for Online Dynamic Power Management. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), pp. 364\u2013367. ACM (2006)","DOI":"10.1145\/1109557.1109598"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-75520-3_14","volume-title":"Algorithms \u2013 ESA 2007","author":"P. Baptiste","year":"2007","unstructured":"Baptiste, P., Chrobak, M., D\u00fcrr, C.: Polynomial Time Algorithms for Minimum Energy Scheduling. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 136\u2013150. Springer, Heidelberg (2007)"},{"issue":"12","key":"17_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MC.2007.443","volume":"40","author":"L.A. Barroso","year":"2007","unstructured":"Barroso, L.A., H\u00f6lzle, U.: The Case for Energy-Proportional Computing. Computer\u00a040(12), 33\u201337 (2007)","journal-title":"Computer"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Baruah, S., Koren, G., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D.: Online Scheduling in the Presence of Overload. In: Proc. of the 32nd Symp. on Foundations of Computer Science (FOCS), pp. 100\u2013110 (1991)","DOI":"10.1109\/SFCS.1991.185354"},{"key":"17_CR12","unstructured":"Chan, H.-L., Chan, W.-T., Lam, T.-W., Lee, L.-K., Mak, K.-S., Wong, P.W.H.: Energy Efficient Online Deadline Scheduling. In: Proceedings ofthe 18th Symposium on Discrete Algorithms (SODA), pp. 795\u2013804. SIAM (2007)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-18318-8_6","volume-title":"Approximation and Online Algorithms","author":"H.-L. Chan","year":"2011","unstructured":"Chan, H.-L., Lam, T.-W., Li, R.: Tradeoff between Energy and Throughput for Online Deadline Scheduling. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol.\u00a06534, pp. 59\u201370. Springer, Heidelberg (2011)"},{"key":"17_CR14","unstructured":"Cord-Landwehr, A., Kling, P., Mallmann-Trenn, F.: Slow Down & Sleep for Profit in Online Deadline Scheduling. arXiv:1209.2848 [cs.DS] (2012)"},{"issue":"42","key":"17_CR15","doi-asserted-by":"publisher","first-page":"3587","DOI":"10.1016\/j.tcs.2010.05.035","volume":"411","author":"X. Han","year":"2010","unstructured":"Han, X., Lam, T.-W., Lee, L.-K., To, I.K.K., Wong, P.W.H.: Deadline Scheduling and Power Management for Speed Bounded Processors. Theoretical Computer Science\u00a0411(42), 3587\u20133600 (2010)","journal-title":"Theoretical Computer Science"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Irani, S., Shukla, S., Gupta, R.: Algorithms for Power Savings. ACM Transactions on Algorithm\u00a03(4) (2007)","DOI":"10.1145\/1290672.1290678"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-15369-3_27","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Pruhs","year":"2010","unstructured":"Pruhs, K., Stein, C.: How to Schedule When You Have to Buy Your Energy. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010, LNCS, vol.\u00a06302, pp. 352\u2013365. Springer, Heidelberg (2010)"},{"key":"17_CR18","unstructured":"Yao, F.F., Demers, A.J., Shenker, S.: A Scheduling Model for Reduced CPU Energy. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 374\u2013382 (1995)"}],"container-title":["Lecture Notes in Computer Science","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T20:38:46Z","timestamp":1745354326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}