{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:35:38Z","timestamp":1743078938156,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319571850"},{"type":"electronic","value":"9783319571867"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57186-7_34","type":"book-chapter","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T11:29:15Z","timestamp":1491996555000},"page":"460-474","source":"Crossref","is-referenced-by-count":1,"title":["A Profit-Maximum Resource Allocation Approach for Mapreduce in Data Centers"],"prefix":"10.1007","author":[{"given":"Xiaolu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuejie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Moseley, B., Dasgupta, A., Kumar, R., Sarlos, T.: On scheduling in map-reduce and flow-shops. In: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 289\u2013298 (2011)","DOI":"10.1145\/1989493.1989540"},{"issue":"1","key":"34_CR2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TSC.2015.2426186","volume":"9","author":"S Tang","year":"2016","unstructured":"Tang, S., Lee, B.S., He, B.: Dynamic job ordering and slot configurations for mapreduce workloads. IEEE Trans. Serv. Comput. 9(1), 4\u201317 (2016)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Jiang, Y., Wu, W., Ding, L.: Minimizing makespan and total completion time in mapreduce-like systems. In: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014), pp. 2166\u20132174 (2014)","DOI":"10.1109\/INFOCOM.2014.6848159"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Kolb, L., Thor, A., Rahm, E.: Load balancing for mapreduce-based entity resolution. In: Proceedings of the 28th IEEE International Conference on Data Engineering, pp. 618\u2013629 (2012)","DOI":"10.1109\/ICDE.2012.22"},{"issue":"1","key":"34_CR5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TNET.2014.2362745","volume":"24","author":"W Wang","year":"2016","unstructured":"Wang, W., Zhu, K., Ying, L., Tan, J., Zhang, L.: MapTask scheduling in mapreduce with data locality: throughput and heavy-traffic optimality. IEEE\/ACM Trans. Netw. 24(1), 190\u2013203 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"12","key":"34_CR6","doi-asserted-by":"crossref","first-page":"2962","DOI":"10.4304\/jcp.7.12.2962-2970","volume":"7","author":"X Wang","year":"2012","unstructured":"Wang, X., Wang, Y., Zhu, H.: Energy-efficient task scheduling model based on MapReduce for cloud computing using genetic algorithm. J. Comput. 7(12), 2962\u20132970 (2012)","journal-title":"J. Comput."},{"issue":"10","key":"34_CR7","doi-asserted-by":"crossref","first-page":"2720","DOI":"10.1109\/TPDS.2014.2358556","volume":"26","author":"L Mashayekhy","year":"2015","unstructured":"Mashayekhy, L., Nejad, M.M., Grosu, D., Zhang, Q., Shi, W.: Energy-aware scheduling of mapreduce jobs for big data applications. IEEE Trans. Parallel Distrib. Syst. 26(10), 2720\u20132733 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Tarplee, K.M., Maciejewski, A.A., Siegel, H.J.: Energy-aware profit maximizing scheduling algorithm for heterogeneous computing systems. In: Proceedings of the 14th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014), pp. 595\u2013603 (2014)","DOI":"10.1109\/CCGrid.2014.43"},{"issue":"2","key":"34_CR9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TSC.2013.40","volume":"7","author":"ZJ Ren","year":"2014","unstructured":"Ren, Z.J., Wan, J., Shi, W.S., Xu, X.H., Zhou, M.: Workload analysis, implications, and optimization on a production hadoop cluster: a case study on taobao. IEEE Trans. Serv. Comput. 7(2), 307\u2013321 (2014)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Verma, A., Cherkasova, L., Campbell, R.H.: Two sides of a coin: optimizing the schedule of mapreduce jobs to minimize their makespan and improve cluster performance. In: Proceedings of the 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 11\u201318 (2012)","DOI":"10.1109\/MASCOTS.2012.12"},{"issue":"8","key":"34_CR11","first-page":"2091","volume":"26","author":"J Song","year":"2015","unstructured":"Song, J., Wang, Z., Li, T.T., Yu, G.: Energy consumption optimization data placement algorithm for mapreduce system. J. softw. 26(8), 2091\u20132110 (2015)","journal-title":"J. softw."},{"issue":"5","key":"34_CR12","first-page":"977","volume":"36","author":"B Lin","year":"2013","unstructured":"Lin, B., Li, S.S., Liao, X.K., Meng, L.B., Liu, X.D., Huang, H.: Seadown: SLA-aware size-scaling power management in heterogeneous mapreduce cluster. J. Comput. 36(5), 977\u2013987 (2013)","journal-title":"J. Comput."},{"issue":"1","key":"34_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.future.2011.07.001","volume":"28","author":"N Maheshwari","year":"2012","unstructured":"Maheshwari, N., Nanduri, R., Varma, V.: Dynamic energy efficient data placement and cluster reconfiguration algorithm for mapreduce framework. Future Gener. Comput. Syst. 28(1), 119\u2013127 (2012)","journal-title":"Future Gener. Comput. Syst."},{"issue":"5","key":"34_CR14","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1109\/TPDS.2014.2374600","volume":"26","author":"JC Lin","year":"2015","unstructured":"Lin, J.C., Leu, F.Y., Chen, Y.: Impact of mapreduce policies on job completion reliability and job energy consumption. IEEE Trans. Parallel Distrib. Syst. 26(5), 1364\u20131378 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Tian, F., Chen, K.: Towards optimal resource provisioning for running mapreduce programs in public clouds. In: Proceedings of 2011 IEEE International Conference on Cloud Computing (CLOUD 2011), pp. 155\u2013162 (2011)","DOI":"10.1109\/CLOUD.2011.14"},{"issue":"5","key":"34_CR16","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/TPDS.2014.2320498","volume":"26","author":"B Palanisamy","year":"2015","unstructured":"Palanisamy, B., Singh, A., Liu, L.: Cost-effective resource provisioning for mapreduce in a cloud. IEEE Trans. Parallel Distrb. Syst. 26(5), 1265\u20131279 (2015)","journal-title":"IEEE Trans. Parallel Distrb. Syst."},{"issue":"2","key":"34_CR17","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/s11227-012-0740-7","volume":"63","author":"BD Young","year":"2013","unstructured":"Young, B.D., Apodaca, J., Brice\u00f1o, L.D., Smith, J., Pasricha, S., Maciejewski, A.A., Siegel, H.J., Khemka, B., Bahirat, S., Ramirez, A., Zou, Y.: Deadline and energy constrained dynamic resource allocation in a heterogeneous computing environment. J. Supercomput. 63(2), 326\u2013347 (2013)","journal-title":"J. Supercomput."},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Li, W.D., Liu, X., Zhang, X.J., Cai, X.B.: A Task-type-based algorithm for the energy-aware profit maximizing scheduling problem in heterogeneous computing systems. In: Proceedings of the 15th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2015), pp. 1107\u20131110 (2015)","DOI":"10.1109\/CCGrid.2015.63"},{"issue":"2","key":"34_CR19","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/moor.26.2.324.10559","volume":"26","author":"K Jansen","year":"2001","unstructured":"Jansen, K., Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. Math. Oper. Res. 26(2), 324\u2013338 (2001)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"34_CR20","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Prog. 62(1\u20133), 461\u2013474 (1993)","journal-title":"Math. Prog."},{"key":"34_CR21","unstructured":"Huang, B.C., Jebara, T.: Fast b-matching via sufficient selection belief propagation. In: Proceedings of AISTATS, pp. 361\u2013369 (2011)"}],"container-title":["Lecture Notes in Computer Science","Green, Pervasive, and Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57186-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T23:47:21Z","timestamp":1517528841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57186-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319571850","9783319571867"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57186-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}