{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:29:34Z","timestamp":1744900174964,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,20]],"date-time":"2017-08-20T00:00:00Z","timestamp":1503187200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NSFC(Natural Science Foundation of China)","award":["71371129","71531011"],"award-info":[{"award-number":["71371129","71531011"]}]},{"name":"NSFC(Natural Science Foundation of China)","award":["71428002","71571134"],"award-info":[{"award-number":["71428002","71571134"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-017-0167-4","type":"journal-article","created":{"date-parts":[[2017,8,20]],"date-time":"2017-08-20T01:38:05Z","timestamp":1503193085000},"page":"216-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Online MapReduce processing on two identical parallel machines"],"prefix":"10.1007","volume":"35","author":[{"given":"Jidan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3190-5008","authenticated-orcid":false,"given":"Ming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,20]]},"reference":[{"key":"167_CR1","doi-asserted-by":"crossref","unstructured":"Chen F, Kodialam M, Lakshman TV (2012) Joint scheduling of processing and shuffle phases in MapReduce systems. In: INFOCOM, 2012 Proceedings IEEE, pp 1143\u20131151","DOI":"10.1109\/INFCOM.2012.6195473"},{"key":"167_CR2","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1007\/s10878-015-9982-7","volume":"33","author":"C Chen","year":"2017","unstructured":"Chen C, Xu Y, Zhu Y, Sun C (2017) Online MapReduce scheduling problem of minimizing the makespan. J Comb Optim 33:590\u2013608","journal-title":"J Comb Optim"},{"issue":"1","key":"167_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"167_CR4","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle U, Kern W, Turan G (1989) On the performance of on-line algorithms for partition problems. Acta Cybern 9:107\u2013119","journal-title":"Acta Cybern"},{"key":"167_CR5","doi-asserted-by":"crossref","unstructured":"Fiat A, Woeginger G (1998) Competitive analysis of algorithms. In: LNCS 1442. Springer Berlin, pp 1\u201312","DOI":"10.1007\/BFb0029562"},{"key":"167_CR6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessor anomalies. Bell Syst Tech J 45:1563\u20131581","journal-title":"Bell Syst Tech J"},{"key":"167_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s11590-015-0902-7","volume":"11","author":"T Luo","year":"2017","unstructured":"Luo T, Zhu Y, Wu W, Xu Y, Du D (2017) Online makespan minimization in MapReduce-like systems with complex reduce tasks. Optim Lett 11:271\u2013277","journal-title":"Optim Lett"},{"key":"167_CR8","doi-asserted-by":"crossref","unstructured":"Moseley B, Dasgupta A, Kumar R, Sarl\u00f3s T (2011) On scheduling in map-reduce and flow-shops. In: Proceedings of the twenty-third annual ACM symposium on parallelism in algorithms and architectures, ACM, SPAA, vol 11, pp 289\u2013298","DOI":"10.1145\/1989493.1989540"},{"issue":"1","key":"167_CR9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/2492101.1555384","volume":"37","author":"T Sandholm","year":"2009","unstructured":"Sandholm T, Lai K (2009) MapReduce optimization using regulated dynamic prioritization. SIGMETRICS Perform Eval Rev 37(1):299\u2013310","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"167_CR10","doi-asserted-by":"crossref","unstructured":"Zheng Y, Shroff N, Sinha P (2013) A new analytical technique for designing provably efficient MapReduce schedulers. In: INFOCOM, 2013 Proceedings IEEE, pp 1600\u20131608","DOI":"10.1109\/INFCOM.2013.6566956"},{"key":"167_CR11","doi-asserted-by":"crossref","unstructured":"Zhu Y, Jiang Y, Wu W, Ding L, Teredesai A, Li D, Lee W (2014) Minimizing makespan and total completion time in MapReduce-like systems. In: INFOCOM, 2014 Proceedings IEEE, pp 2166\u20132174","DOI":"10.1109\/INFOCOM.2014.6848159"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0167-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0167-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0167-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T21:30:35Z","timestamp":1602797435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0167-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,20]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0167-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,8,20]]}}}