{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:02:50Z","timestamp":1725825770388},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480953"},{"type":"electronic","value":"9783662480960"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48096-0_14","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T06:16:03Z","timestamp":1437718563000},"page":"171-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down"],"prefix":"10.1007","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Chau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Kim","family":"Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Albers, S., Antoniadis, A.: Race to idle: new algorithms for speed scaling with a sleep state. In: SODA, pp. 1266\u20131285. SIAM (2012)","key":"14_CR1","DOI":"10.1137\/1.9781611973099.100"},{"doi-asserted-by":"crossref","unstructured":"Albers, S., M\u00fcller, F., Schmelzer, S.: Speed scaling on parallel processors. In: SPAA, pp. 289\u2013298. ACM (2007)","key":"14_CR2","DOI":"10.1145\/1248377.1248424"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.05.023","volume":"175","author":"E Angel","year":"2014","unstructured":"Angel, E., Bampis, E., Chau, V.: Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines. Discrete Appl. Math. 175, 1\u201310 (2014)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Angel, E., Bampis, E., Chau, V.: Throughput maximization in the speed-scaling setting. In: STACS. LIPIcs vol. 25, pp. 53\u201362 (2014)","key":"14_CR4","DOI":"10.1007\/978-3-319-13075-0_20"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-38236-9_2","volume-title":"Theory and Applications of Models of Computation","author":"E Angel","year":"2013","unstructured":"Angel, E., Bampis, E., Chau, V., Letsios, D.: Throughput maximization for speed-scaling with agreeable deadlines. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 10\u201319. Springer, Heidelberg (2013)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-319-13075-0_20","volume-title":"Algorithms and Computation","author":"E Angel","year":"2014","unstructured":"Angel, E., Bampis, E., Chau, V., Thang, N.K.: Throughput maximization in multiprocessor speed-scaling. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 247\u2013258. Springer, Heidelberg (2014)"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10951-013-0312-6","volume":"16","author":"A Antoniadis","year":"2013","unstructured":"Antoniadis, A., Huang, C.C.: Non-preemptive speed scaling. J. Sched. 16(4), 385\u2013394 (2013)","journal-title":"J. Sched."},{"issue":"4","key":"14_CR8","first-page":"184","volume":"2","author":"E Bampis","year":"2012","unstructured":"Bampis, E., D\u00fcrr, C., Kacem, F., Milis, I.: Speed scaling with power down scheduling for agreeable deadlines. Sustain. Comput. Inf. Syst. 2(4), 184\u2013189 (2012)","journal-title":"Sustain. Comput. Inf. Syst."},{"unstructured":"Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., Sviridenko, M.: Energy efficient scheduling and routing via randomized rounding. In: FSTTCS. LIPIcs, vol. 24, pp. 449\u2013460 (2013)","key":"14_CR9"},{"doi-asserted-by":"crossref","unstructured":"Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: SODA, pp. 364\u2013367. ACM Press (2006)","key":"14_CR10","DOI":"10.1145\/1109557.1109598"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/2229163.2229170","volume":"8","author":"P Baptiste","year":"2012","unstructured":"Baptiste, P., Chrobak, M., D\u00fcrr, C.: Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3), 26 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR12","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2010","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer Publishing Company, Incorporated, Heidelberg (2010)","edition":"5"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-38233-8_9","volume-title":"Algorithms and Complexity","author":"M Chrobak","year":"2013","unstructured":"Chrobak, M., Feige, U., Hajiaghayi, M.T., Khanna, S., Li, F., Naor, S.: A greedy approximation algorithm for minimum-gap scheduling. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 97\u2013109. Springer, Heidelberg (2013)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-319-18263-6_10","volume-title":"Approximation and Online Algorithms","author":"V Cohen-Addad","year":"2015","unstructured":"Cohen-Addad, V., Li, Z., Mathieu, C., Milis, I.: Energy-efficient algorithms for non-preemptive speed-scaling. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 107\u2013118. Springer, Heidelberg (2015)"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s11241-007-9029-y","volume":"37","author":"B Gaujal","year":"2007","unstructured":"Gaujal, B., Navet, N.: Dynamic voltage scaling under EDF revisited. Real-Time Syst. 37(1), 77\u201397 (2007)","journal-title":"Real-Time Syst."},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1145\/1113830.1113838","volume":"4","author":"B Gaujal","year":"2005","unstructured":"Gaujal, B., Navet, N., Walsh, C.: Shortest-path algorithms for real-time scheduling of FIFO tasks with minimal energy use. ACM Trans. Embed. Comput. Syst. 4(4), 907\u2013933 (2005)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Irani, S., Shukla, S.K., Gupta, R.: Algorithms for power savings. ACM Trans. Algorithms 3(4) (2007). Article No 41","key":"14_CR17","DOI":"10.1145\/1290672.1290678"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1287\/opre.26.1.121","volume":"26","author":"H Kise","year":"1978","unstructured":"Kise, H., Ibaraki, T., Mine, H.: A solvable case of the one-machine scheduling problem with ready and due times. Oper. Res. 26(1), 121\u2013126 (1978)","journal-title":"Oper. Res."},{"issue":"32","key":"14_CR19","doi-asserted-by":"publisher","first-page":"4074","DOI":"10.1016\/j.tcs.2010.10.011","volume":"412","author":"M Li","year":"2011","unstructured":"Li, M.: Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics. Theor. Comput. Sci. 412(32), 4074\u20134080 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/11549345_56","volume-title":"Mathematical Foundations of Computer Science 2005","author":"M Li","year":"2005","unstructured":"Li, M., Yao, F.F.: An efficient algorithm for computing optimal discrete voltage schedules. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 652\u2013663. Springer, Heidelberg (2005)"},{"issue":"12\u201314","key":"14_CR21","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1016\/j.tcs.2010.12.013","volume":"412","author":"W Wu","year":"2011","unstructured":"Wu, W., Li, M., Chen, E.: Min-energy scheduling for aligned jobs in accelerate model. Theor. Comput. Sci. 412(12\u201314), 1122\u20131139 (2011)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS, pp. 374\u2013382. IEEE Computer Society (1995)","key":"14_CR22"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2015: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48096-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T23:23:18Z","timestamp":1652916198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48096-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480953","9783662480960"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48096-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}