{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:51:07Z","timestamp":1648630267505},"reference-count":50,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2019,9,1]]},"DOI":"10.1587\/transinf.2018edp7431","type":"journal-article","created":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T22:11:10Z","timestamp":1567289470000},"page":"1731-1739","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Throughput Allocation among Multiple Servers for Heterogeneous Storage System"],"prefix":"10.1587","volume":"E102.D","author":[{"given":"Zhisheng","family":"HUO","sequence":"first","affiliation":[{"name":"State Key Laboratory of Software Development Environment, Beihang University"},{"name":"School of Computer Science and Engineering, Beihang University"}]},{"given":"Limin","family":"XIAO","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Software Development Environment, Beihang University"},{"name":"School of Computer Science and Engineering, Beihang University"}]},{"given":"Zhenxue","family":"HE","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology, Hebei Agricultural University"}]},{"given":"Xiaoling","family":"RONG","sequence":"additional","affiliation":[{"name":"School of Communication Science, Beijing Language and Culture University"}]},{"given":"Bing","family":"WEI","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Software Development Environment, Beihang University"},{"name":"School of Computer Science and Engineering, Beihang University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Z. Huo, L. Xiao, Q. Zhong, S. Li, A. Li, R. Li, K. Liu, Y. Zang, P. Wang, and Z. Lu, \u201cHybrid storage throughput allocation among multiple clients in heterogeneous data center,\u201d IEEE International Conference on High PERFORMANCE Computing and Communications, 2015 IEEE International Symposium on Cyberspace Safety and Security, and 2015 IEEE International Conf on Embedded Software and Systems, pp.140-147, 2015. 10.1109\/hpcc-css-icess.2015.49","DOI":"10.1109\/HPCC-CSS-ICESS.2015.49"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Z. Huo, L. Xiao, Q. Zhong, S. Li, A. Li, R. Li, S. Wang, and L. Fu, A Metadata Cooperative Caching Architecture Based on SSD and DRAM for File Systems, Springer International Publishing, 2015.","DOI":"10.1007\/978-3-319-27122-4_3"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R. Katz, A.Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M.Zaharia, \u201cA View of Cloud Computing,\u201d Commun. ACM, vol.53, no.4, pp.50-58, April 2010. 10.1145\/1721654.1721672","DOI":"10.1145\/1721654.1721672"},{"key":"4","unstructured":"[4] C. Reiss, A. Tumanov, G.R. Ganger, R.H. Katz, and M.A. Kozuch, \u201cHeterogeneity and dynamicity of clouds at scale: Google trace analysis,\u201d Proc. Third ACM Symposium on Cloud Computing, SoCC &apos;12, New York, NY, USA, pp.7:1-7:13, ACM, 2012. 10.1145\/2391229.2391236"},{"key":"5","unstructured":"[5] C. Reiss, J. Wilkes, and J.L. Hellerstein, \u201cGoogle cluster-usage traces: format+ schema,\u201d White Paper, Google Inc., 2011."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] B. Farley, A. Juels, V. Varadarajan, T. Ristenpart, K.D. Bowers, and M.M. Swift, \u201cMore for your money: exploiting performance heterogeneity in public clouds,\u201d Proc. Third ACM Symposium on Cloud Computing, p.20, ACM, 2012. 10.1145\/2391229.2391249","DOI":"10.1145\/2391229.2391249"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Z. Ou, H. Zhuang, A. Lukyanenko, J. Nurminen, P. Hui, V. Mazalov, and A. Yla-Jaaski, \u201cIs the same instance type created equal? Exploiting heterogeneity of public clouds,\u201d 2013.","DOI":"10.1109\/TCC.2013.12"},{"key":"8","unstructured":"[8] T. Harter, D. Borthakur, S. Dong, A.S. Aiyer, L. Tang, A.C. Arpaci-Dusseau, and R.H. Arpaci-Dusseau, \u201cAnalysis of HDFS under hbase: a facebook messages case study,\u201d FAST, pp.199-212, 2014."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] X. Wu and A.L.N. Reddy, \u201cExploiting concurrency to improve latency and throughput in a hybrid storage system,\u201d 2010 IEEE International Symposium on Modeling, Analysis &amp; Simulation of Computer and Telecommunication Systems (MASCOTS), pp.14-23, IEEE, 2010. 10.1109\/mascots.2010.11","DOI":"10.1109\/MASCOTS.2010.11"},{"key":"10","unstructured":"[10] Y. Wang and A. Merchant, \u201cProportional-share scheduling for distributed storage systems,\u201d FAST, p.4, 2007."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] A. Gulati, A. Merchant, and P.J. Varman, \u201cpclock: an arrival curve based approach for qos guarantees in shared storage systems,\u201d ACM SIGMETRICS Performance Evaluation Review, vol.35, no.1, pp.13-24, 2007. 10.1145\/1269899.1254885","DOI":"10.1145\/1269899.1254885"},{"key":"12","unstructured":"[12] A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and I. Stoica, \u201cDominant resource fairness: Fair allocation of multiple resource types,\u201d NSDI, p.24, 2011."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] C. Joe-Wong, S. Sen, T. Lan, and M. Chiang, \u201cMultiresource allocation: fairness-efficiency tradeoffs in a unifying framework,\u201d IEEE\/ACM Trans. Netw., vol.21, no.6, pp.1785-1798, 2013. 10.1109\/tnet.2012.2233213","DOI":"10.1109\/TNET.2012.2233213"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] W. Wang, B. Liang, and B. Li, \u201cMulti-resource fair allocation in heterogeneous cloud computing systems,\u201d IEEE Trans. Parallel Distrib. Syst., vol.26, no.10, pp.2822-2835, 2015. 10.1109\/tpds.2014.2362139","DOI":"10.1109\/TPDS.2014.2362139"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] J. Li and J. Xue, \u201cEgalitarian division under leontief preferences,\u201d Economic Theory, vol.54, no.3, pp.597-622, 2013. 10.1007\/s00199-012-0724-0","DOI":"10.1007\/s00199-012-0724-0"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] A.D. Procaccia, \u201cCake cutting: not just child&apos;s play,\u201d Commun. ACM, vol.56, no.7, pp.78-87, 2013. 10.1145\/2483852.2483870","DOI":"10.1145\/2483852.2483870"},{"key":"17","unstructured":"[17] H. Wang and P.J. Varman, \u201cBalancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation,\u201d FAST, pp.229-242, 2014."},{"key":"18","unstructured":"[18] I. Kash, A.D. Procaccia, and N. Shah, \u201cNo agent left behind: dynamic fair division of multiple resources,\u201d International Conference on Autonomous Agents and Multi-Agent Systems, pp.351-358, 2013."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] E. Friedman, C.-A. Psomas, and S. Vardi, \u201cDynamic fair division with minimal disruptions,\u201d Sixteenth ACM Conference on Economics and Computation, pp.697-713, 2015. 10.1145\/2764468.2764495","DOI":"10.1145\/2764468.2764495"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] A. Demers, S. Keshav, and S. Shenker, \u201cAnalysis and simulation of a fair queueing algorithm,\u201d ACM SIGCOMM Computer Communication Review, pp.1-12, ACM, 1989.","DOI":"10.1145\/75247.75248"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] P. Goyal, H.M. Vin, and H. Chen, \u201cStart-time fair queueing: a scheduling algorithm for integrated services packet switching networks,\u201d ACM SIGCOMM Computer Communication Review, pp.157-168, ACM, 1996.","DOI":"10.1145\/248157.248171"},{"key":"22","unstructured":"[22] C.A. Waldspurger and W.E. Weihl, \u201cLottery scheduling: Flexible proportional-share resource management,\u201d Proc. 1st USENIX Conference on Operating Systems Design and Implementation, p.1, USENIX Association, 1994."},{"key":"23","unstructured":"[23] A. Gulati, I. Ahmad, C.A. Waldspurger, <i>et al.<\/i>, \u201cParda: Proportional allocation of resources for distributed storage access,\u201d FAST, pp.85-98, 2009."},{"key":"24","unstructured":"[24] A. Gulati, C. Kumar, I. Ahmad, and K. Kumar, \u201cBasil: Automated io load balancing across storage devices,\u201d FAST, p.13, 2010."},{"key":"25","unstructured":"[25] C.R. Lumb, A. Merchant, and G.A. Alvarez, \u201cFa\u00e7ade: Virtual storage devices with performance guarantees,\u201d FAST, pp.131-144, 2003."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] W. Jin, J.S. Chase, and J. Kaur, \u201cInterposed proportional sharing for a storage service utility,\u201d ACM SIGMETRICS Performance Evaluation Review, pp.37-48, ACM, 2004.","DOI":"10.1145\/1012888.1005694"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] C.R. Lumb, J. Schindler, G.R. Ganger, D.F. Nagle, and E. Riedel, \u201cTowards higher disk head utilization: extracting free bandwidth from busy disk drives,\u201d Proc. 4th Conference on Symposium on Operating System Design &amp; Implementation, vol.4, p.7, USENIX Association, 2000.","DOI":"10.21236\/ADA382318"},{"key":"28","unstructured":"[28] A. Gulati, A. Merchant, and P.J. Varman, \u201cmclock: Handling throughput variability for hypervisor io scheduling,\u201d Proc. 9th USENIX Conference on Operating Systems Design and Implementation, pp.1-7, 2013."},{"key":"29","unstructured":"[29] C. Li, \u00cd. Goiri, A. Bhattacharjee, R. Bianchini, and T.D. Nguyen, \u201cQuantifying and improving i\/o predictability in virtualized systems,\u201d Ieee\/acm International Symposium on Quality of Service, pp.1-6, 2013. 10.1109\/iwqos.2013.6550269"},{"key":"30","unstructured":"[30] D. Shue, M.J. Freedman, and A. Shaikh, \u201cPerformance isolation and fairness for multi-tenant cloud storage,\u201d Usenix Conference on Operating Systems Design and Implementation, pp.349-362, 2012."},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] I. Stoica, H. Abdel-Wahab, and K. Jeffay, \u201cDuality between resource reservation and proportional share resource allocation,\u201d Electronic Imaging&apos;97, pp.207-214, International Society for Optics and Photonics, 1997.","DOI":"10.1117\/12.264293"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] M. Karlsson, C. Karamanolis, and X. Zhu, \u201cTriage: Performance differentiation for storage systems using adaptive control,\u201d ACM Transactions on Storage (TOS), vol.1, no.4, pp.457-480, 2005. 10.1145\/1111609.1111612","DOI":"10.1145\/1111609.1111612"},{"key":"33","unstructured":"[33] T.M. Wong, R.A. Golding, C. Lin, and R.A. Becker-Szendy,\u201cZygaria: Storage performance as a managed resource,\u201d Proc. 12th IEEE Real-Time and Embedded Technology and Applications Symposium, 2006, pp.125-134, IEEE, 2006. 10.1109\/rtas.2006.46"},{"key":"34","unstructured":"[34] A. Gulati, A. Merchant, and P.J. Varman, \u201cmclock: handling throughput variability for hypervisor io scheduling,\u201d Proc. 9th USENIX Conference on Operating Systems Design and Implementation, pp.1-7, USENIX Association, 2010."},{"key":"35","unstructured":"[35] A. Gulati, G. Shanmuganathan, X. Zhang, and P.J. Varman, \u201cDemand based hierarchical qos using storage resource pools,\u201d USENIX Annual Technical Conference, pp.1-13, 2012."},{"key":"36","doi-asserted-by":"publisher","unstructured":"[36] A. Ghodsi, V. Sekar, M. Zaharia, and I. Stoica, \u201cMulti-resource fair queueing for packet processing,\u201d ACM SIGCOMM Computer Communication Review, vol.42, no.4, pp.1-12, 2012. 10.1145\/2377677.2377679","DOI":"10.1145\/2377677.2377679"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] D.C. Parkes, A.D. Procaccia, and N. Shah, \u201cBeyond dominant resource fairness: extensions, limitations, and indivisibilities,\u201d Proc. 13th ACM Conference on Electronic Commerce, pp.808-825, ACM, 2012. 10.1145\/2229012.2229075","DOI":"10.1145\/2229012.2229075"},{"key":"38","doi-asserted-by":"crossref","unstructured":"[38] D. Dolev, D.G. Feitelson, J.Y. Halpern, R. Kupferman, and N. Linial, \u201cNo justified complaints: On fair sharing of multiple resources,\u201d Proc. 3rd Innovations in Theoretical Computer Science Conference, pp.68-75, ACM, 2012. 10.1145\/2090236.2090243","DOI":"10.1145\/2090236.2090243"},{"key":"39","unstructured":"[39] A. Gutman and N. Nisan, \u201cFair allocation without trade,\u201d Proc. 11th International Conference on Autonomous Agents and Multiagent Systems, vol.2, pp.719-728, International Foundation for Autonomous Agents and Multiagent Systems, 2012."},{"key":"40","unstructured":"[40] C.A. Psomas and J. Schwartz, \u201cBeyond beyond dominant resource fairness: Indivisible resource allocation in clusters,\u201d Tech. Report Berkeley, 2013."},{"key":"41","unstructured":"[41] S. Park and K. Shen, \u201cFios: A fair, efficient flash i\/o scheduler,\u201d FAST, p.13, 2012."},{"key":"42","unstructured":"[42] K. Shen and S. Park, \u201cFlashfq: A fair queueing i\/o scheduler for flash-based ssds,\u201d USENIX Annual Technical Conference, pp.67-78, 2013."},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] A. Elnably, K. Du, and P. Varman, \u201cReward scheduling for qos in cloud applications,\u201d 2012 12th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp.98-106, IEEE, 2012. 10.1109\/ccgrid.2012.120","DOI":"10.1109\/CCGrid.2012.120"},{"key":"44","unstructured":"[44] A. Elnably and P. Varman, \u201cApplication-sensitive qos scheduling in storage servers,\u201d ACM Symposium on Parallelism in Algorithms and Architecture, 2012."},{"key":"45","unstructured":"[45] A. Elnably, H. Wang, A. Gulati, and P. Varman, \u201cEfficient qos for multi-tiered storage systems,\u201d 4th USENIX Workshop on Hot Topics in Storage and File Systems, 2012."},{"key":"46","unstructured":"[46] W. Wang, B. Liang, and B. Li, \u201cMulti-resource fair allocation in heterogeneous cloud computing systems,\u201d"},{"key":"47","doi-asserted-by":"crossref","unstructured":"[47] X. Liu, X. Zhang, X. Zhang, and W. Li, \u201cDynamic fair division of multiple resources with satiable agents in cloud computing systems,\u201d IEEE Fifth International Conference on Big Data and Cloud Computing, pp.131-136, 2015. 10.1109\/bdcloud.2015.71","DOI":"10.1109\/BDCloud.2015.71"},{"key":"48","unstructured":"[48] R. McDougall and J. Mauro, \u201cFilebench,\u201d URL: http:\/\/www.nfsv4bat.org\/Documents\/nasconf\/2004\/filebench.pdf (cited on page 56), 2005."},{"key":"49","unstructured":"[49] S.P. Council, \u201cSpc i\/o traces,\u201d 2009."},{"key":"50","doi-asserted-by":"crossref","unstructured":"[50] S. Kavalanekar, B. Worthington, Q. Zhang, and V. Sharda, \u201cCharacterization of storage workload traces from production windows servers,\u201d IEEE International Symposium on Workload Characterization, 2008, IISWC 2008, pp.119-128, IEEE, 2008. 10.1109\/iiswc.2008.4636097","DOI":"10.1109\/IISWC.2008.4636097"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/9\/E102.D_2018EDP7431\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T03:27:52Z","timestamp":1567826872000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/9\/E102.D_2018EDP7431\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":50,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018edp7431","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}