{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:42Z","timestamp":1742912382857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030035952"},{"type":"electronic","value":"9783030035969"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03596-9_60","type":"book-chapter","created":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T08:17:58Z","timestamp":1541492278000},"page":"837-853","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["QKnober: A Knob-Based Fairness-Efficiency Scheduler for Cloud Computing with QoS Guarantees"],"prefix":"10.1007","author":[{"given":"Shanjiang","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ce","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinglong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,7]]},"reference":[{"key":"60_CR1","unstructured":"Apache TPC-H benchmark on hive. https:\/\/issues.apache.org\/jira\/browse\/HIVE-600"},{"key":"60_CR2","unstructured":"Puma datasets. http:\/\/web.ics.purdue.edu\/fahmad\/datasets.htm"},{"key":"60_CR3","unstructured":"Ahmad, F., Lee, S., Thottethodi, M., Vijaykumar, T.N.: PUMA: Purdue mapreduce benchmarks suite. ECE technical reports (2012)"},{"issue":"3","key":"60_CR4","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/65979.65981","volume":"11","author":"RP Brent","year":"1989","unstructured":"Brent, R.P.: Efficient implementation of the first-fit strategy for dynamic storage allocation. ACM Trans. Program. Lang. Syst. 11(3), 388\u2013403 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"60_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4(1), 63\u201386 (1998)","journal-title":"J. Heuristics"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Dageville, B., Zait, M.: SQL memory management in Oracle9i. In: VLDB 2002, pp. 962\u2013973. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50095-0"},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"Danna, E., Mandal, S., Singh, A.: A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering. In: INFOCOM 2012, pp. 846\u2013854 (2012)","DOI":"10.1109\/INFCOM.2012.6195833"},{"issue":"1","key":"60_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"60_CR9","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: fair allocation of multiple resource types. In: NSDI 2011, Berkeley, CA, USA, pp. 323\u2013336. USENIX Association (2011)"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Grandl, R., Ananthanarayanan, G., Kandula, S., Rao, S., Akella, A.: Multi-resource packing for cluster schedulers. In: SIGCOMM 2014, pp. 455\u2013466. ACM (2014)","DOI":"10.1145\/2619239.2626334"},{"issue":"6","key":"60_CR11","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1109\/TNET.2012.2233213","volume":"21","author":"C Joe-Wong","year":"2013","unstructured":"Joe-Wong, C., Sen, S., Lan, T., Chiang, M.: Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework. IEEE\/ACM Trans. Netw. 21(6), 1785\u20131798 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"60_CR12","unstructured":"Niu, Z., Tang, S., He, B.: An adaptive efficiency-fairness meta-scheduler for data-intensive computing. IEEE Trans. Serv. Comput., p. 1 (2017)"},{"issue":"1","key":"60_CR13","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2739040","volume":"3","author":"DC Parkes","year":"2015","unstructured":"Parkes, D.C., Procaccia, A.D., Shah, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Trans. Econ. Comput. 3(1), 3:1\u20133:22 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Tang, S., Yu, C., Sun, C., Xiao, J., Li, Y.: QKnober: a knob-based fairness-efficiency scheduler for cloud computing with QoS guarantees. Technical report (2018). http:\/\/cs.tju.edu.cn\/faculty\/tangshanjiang\/tr\/QKnoberTR.pdf","DOI":"10.1007\/978-3-030-03596-9_60"},{"issue":"1","key":"60_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/TSC.2016.2531698","volume":"11","author":"S Tang","year":"2018","unstructured":"Tang, S., Lee, B.S., He, B.: Fair resource allocation for data-intensive computing in the cloud. IEEE Trans. Serv. Comput. 11(1), 20\u201333 (2018)","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"5","key":"60_CR16","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TPDS.2017.2788880","volume":"29","author":"S Tang","year":"2018","unstructured":"Tang, S., Niu, Z., He, B., Lee, B.S., Yu, C.: Long-term multi-resource fairness for pay-as-you use computing systems. IEEE Trans. Parallel Distrib. Syst. 29(5), 1147\u20131160 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"60_CR17","doi-asserted-by":"crossref","unstructured":"Tang, S., He, B.S., Zhang, S., Niu, Z.: Elastic multi-resource fairness: balancing fairness and efficiency in coupled CPU-GPU architectures. In: SC 2016, Piscataway, NJ, USA, pp. 75:1\u201375:12. IEEE Press (2016)","DOI":"10.1109\/SC.2016.74"},{"key":"60_CR18","doi-asserted-by":"crossref","unstructured":"Tang, S., Lee, B.S., He, B., Liu, H.: Long-term resource fairness: towards economic fairness on pay-as-you-use computing systems. In: ICS 2014, New York, NY, USA, pp. 251\u2013260. ACM (2014)","DOI":"10.1145\/2597652.2597672"},{"issue":"1","key":"60_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"Vavilapalli, V.K., Murthy, A.C., Douglas, C., Agarwal, S.: Apache hadoop YARN: yet another resource negotiator. In: SOCC 2013, New York, NY, USA, pp. 5:1\u20135:16. ACM (2013)","DOI":"10.1145\/2523616.2523633"},{"key":"60_CR21","unstructured":"Wang, H., Varman, P.: Balancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation. In: FAST 2014, Berkeley, CA, USA, pp. 229\u2013242. USENIX Association (2014)"},{"key":"60_CR22","doi-asserted-by":"crossref","unstructured":"Wang, W., Feng, C., Li, B., Liang, B.: On the fairness-efficiency tradeoff for packet processing with multiple resources. In: CoNEXT 2014, New York, NY, USA, pp. 235\u2013248. ACM (2014)","DOI":"10.1145\/2674005.2675010"},{"key":"60_CR23","doi-asserted-by":"crossref","unstructured":"Wang, W., Li, B., Liang, B.: Dominant resource fairness in cloud computing systems with heterogeneous servers. In: 2014 Proceedings IEEE INFOCOM, pp. 583\u2013591, April 2014","DOI":"10.1109\/INFOCOM.2014.6847983"},{"key":"60_CR24","doi-asserted-by":"crossref","unstructured":"Wang, W., Ma, S., Li, B., Li, B.: Coflex: navigating the fairness-efficiency tradeoff for coflow scheduling. In: INFOCOM 2017","DOI":"10.1109\/INFOCOM.2017.8057172"},{"key":"60_CR25","doi-asserted-by":"crossref","unstructured":"Zaharia, M., Borthakur, D., Sen Sarma, J., Elmeleegy, K., Shenker, S., Stoica, I.: Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling. In: EuroSys 2010, New York, NY, USA, pp. 265\u2013278. ACM (2010)","DOI":"10.1145\/1755913.1755940"},{"key":"60_CR26","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. In: Hot Cloud 2010, vol. 10, p. 10 (2010)"}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03596-9_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:55:05Z","timestamp":1710338105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03596-9_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030035952","9783030035969"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03596-9_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icsoc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}