{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:53:48Z","timestamp":1725576828177},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183171"},{"type":"electronic","value":"9783642183188"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18318-8_6","type":"book-chapter","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T03:58:06Z","timestamp":1295841486000},"page":"59-70","source":"Crossref","is-referenced-by-count":5,"title":["Tradeoff between Energy and Throughput for Online Deadline Scheduling"],"prefix":"10.1007","author":[{"given":"Ho-Leung","family":"Chan","sequence":"first","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Rongbin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S. Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. ACM Communications\u00a053(5), 86\u201396 (2010)","journal-title":"ACM Communications"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms\u00a03(4) (2007)","DOI":"10.1145\/1290672.1290686"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1639562.1639576","volume":"37","author":"L. Andrew","year":"2009","unstructured":"Andrew, L., Wierman, A., Tang, A.: Optimal speed scaling under arbitrary power functions. ACM SIGMETRICS Performance Evaluation Review\u00a037(2), 39\u201341 (2009)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"6_CR4","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 bounded speed 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)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: SODA, pp. 693\u2013701 (2009)","DOI":"10.1137\/1.9781611973068.76"},{"key":"6_CR6","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. LNCS, vol.\u00a05555, pp. 144\u2013155. Springer, Heidelberg (2009)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. JACM\u00a054(1) (2007)","DOI":"10.1145\/1206035.1206038"},{"key":"6_CR8","unstructured":"Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 805\u2013813 (2007)"},{"issue":"1","key":"6_CR9","first-page":"24","volume":"13","author":"C. Belady","year":"2007","unstructured":"Belady, C.: In the data center, power and cooling costs more than the it equipment it supports. Electronics Cooling Magazine\u00a013(1), 24\u201327 (2007), http:\/\/electronics-cooling.com\/articles\/2007\/feb\/a3\/","journal-title":"Electronics Cooling Magazine"},{"key":"6_CR10","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: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 795\u2013804 (2007)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/S0097539792236882","volume":"24","author":"G. Koren","year":"1995","unstructured":"Koren, G., Shasha, D.: Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J. Comput.\u00a024(2), 318\u2013339 (1995)","journal-title":"SIAM J. Comput."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-87744-8_54","volume-title":"Algorithms - ESA 2008","author":"T.W. Lam","year":"2008","unstructured":"Lam, T.W., Lee, L.K., To, I.K.K., Wong, P.W.H.: Speed scaling functions for flow time scheduling based on active job count. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 647\u2013659. Springer, Heidelberg (2008)"},{"key":"6_CR13","unstructured":"Markoff, J., Lohr, S.: Intel\u2019s huge bet turns iffy. New York Times (September 29, 2002)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Pruhs, K., Stein, C.: How to schedule when you have to buy your energy. To appear in RANDOM-APPROX (2010)","DOI":"10.1007\/978-3-642-15369-3_27"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Foundations of Computer Science (FOCS), pp. 374\u2013382 (1995)","DOI":"10.1109\/SFCS.1995.492493"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18318-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T22:56:33Z","timestamp":1559948193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18318-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183171","9783642183188"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18318-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}