{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:30Z","timestamp":1725798630805},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319098722"},{"type":"electronic","value":"9783319098739"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-09873-9_17","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T06:04:21Z","timestamp":1407737061000},"page":"198-209","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Energy Efficient Scheduling of MapReduce Jobs"],"prefix":"10.1007","author":[{"given":"Evripidis","family":"Bampis","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Chau","sequence":"additional","affiliation":[]},{"given":"Dimitrios","family":"Letsios","sequence":"additional","affiliation":[]},{"given":"Giorgio","family":"Lucarelli","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Milis","sequence":"additional","affiliation":[]},{"given":"Georgios","family":"Zois","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Albers, S.: Algorithms for dynamic speed scaling. In: STACS, pp. 1\u201311 (2011)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Angel, E., Bampis, E., Kacem, F.: Energy aware scheduling for unrelated parallel machines. In: Green Computing Conference, pp. 533\u2013540 (2012)","DOI":"10.1109\/GreenCom.2012.78"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1137\/08072125X","volume":"39","author":"N. Bansal","year":"2009","unstructured":"Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. SIAM J. on Computing\u00a039(4), 1294\u20131308 (2009)","journal-title":"SIAM J. on Computing"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chang, H., Kodialam, M.S., Kompella, R.R., Lakshman, T.V., Lee, M., Mukherjee, S.: Scheduling in mapreduce-like systems for fast completion time. In: INFOCOM, pp. 3074\u20133082 (2011)","DOI":"10.1109\/INFCOM.2011.5935152"},{"key":"17_CR5","unstructured":"Chen, F., Kodialam, M.S., Lakshman, T.V.: Joint scheduling of processing and shuffle phases in mapreduce systems. In: INFOCOM, pp. 1143\u20131151 (2012)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Feller, E., Ramakrishnan, L., Morin, C.: On the performance and energy efficiency of Hadoop deployment models. In: BigData Conference, pp. 131\u2013136 (2013)","DOI":"10.1109\/BigData.2013.6691564"},{"key":"17_CR7","unstructured":"Feng, B., Lu, J., Zhou, Y., Yang, N.: Energy efficiency for MapReduce workloads: An in-depth study. In: ADC, pp. 61\u201370 (2012)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Goiri, I., Le, K., Nguyen, T.D., Guitart, J., Torres, J., Bianchini, R.: GreenHadoop: leveraging green energy in data-processing frameworks. In: EuroSys, pp. 57\u201370 (2012)","DOI":"10.1145\/2168836.2168843"},{"key":"17_CR9","unstructured":"Hall, L.A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line algorithms. In: ACM-SIAM SODA, pp. 142\u2013151 (1996)"},{"issue":"5","key":"17_CR10","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.orl.2010.04.011","volume":"38","author":"M. Mastrolilli","year":"2010","unstructured":"Mastrolilli, M., Queyranne, M., Schulz, A.S., Svensson, O., Uhan, N.A.: Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Letters\u00a038(5), 390\u2013395 (2010)","journal-title":"Oper. Res. Letters"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-642-39206-1_63","volume-title":"Automata, Languages, and Programming","author":"N. Megow","year":"2013","unstructured":"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.\u00a07965, pp. 745\u2013756. Springer, Heidelberg (2013)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Moseley, B., Dasgupta, A., Kumar, R., Sarl\u00f3s, T.: On scheduling in map-reduce and flow-shops. In: ACM-SPAA, pp. 289\u2013298 (2011)","DOI":"10.1145\/1989493.1989540"},{"issue":"1-2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01585872","volume":"82","author":"C.A. Phillips","year":"1998","unstructured":"Phillips, C.A., Stein, C., Wein, J.: Minimizing average completion time in the presence of release dates. Math. Programming\u00a082(1-2), 199\u2013223 (1998)","journal-title":"Math. Programming"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00224-007-9070-1","volume":"43","author":"K. Pruhs","year":"2008","unstructured":"Pruhs, K., van Stee, R., Uthaisombut, P.: Speed scaling of tasks with precedence constraints. Theory Comput. Syst.\u00a043, 67\u201380 (2008)","journal-title":"Theory Comput. Syst."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10951-006-7042-y","volume":"9","author":"T.A. Roemer","year":"2006","unstructured":"Roemer, T.A.: A note on the complexity of the concurrent open shop problem. Journal of Scheduling\u00a09, 389\u2013396 (2006)","journal-title":"Journal of Scheduling"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"A.S. Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM J. Discr. Mathematics\u00a015(4), 450\u2013469 (2002)","journal-title":"SIAM J. Discr. Mathematics"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Wirtz, T., Ge, R.: Improving MapReduce energy efficiency for computation intensive workloads. In: IGCC, pp. 1\u20138 (2011)","DOI":"10.1109\/IGCC.2011.6008564"},{"key":"17_CR18","unstructured":"Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced cpu energy. In: IEEE- FOCS, pp. 374\u2013382 (1995)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2014 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09873-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:17:38Z","timestamp":1587341858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09873-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319098722","9783319098739"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09873-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}