Throughput Servicing Time Allocation of Hybrid Storage System Based on Client Grouping Mechanism

HUO Zhisheng; XIAO Limin; HE Zhenxue; RONG Xiaoling

doi:10.1049/cje.2018.11.002

Volume 28 Issue 1

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2019 > 28(1): 62-70

HUO Zhisheng, XIAO Limin, HE Zhenxue, et al., “Throughput Servicing Time Allocation of Hybrid Storage System Based on Client Grouping Mechanism,” Chinese Journal of Electronics, vol. 28, no. 1, pp. 62-70, 2019, doi: 10.1049/cje.2018.11.002

Citation:

HUO Zhisheng, XIAO Limin, HE Zhenxue, et al., “Throughput Servicing Time Allocation of Hybrid Storage System Based on Client Grouping Mechanism,” Chinese Journal of Electronics, vol. 28, no. 1, pp. 62-70, 2019, doi: 10.1049/cje.2018.11.002

Citation:

PDF( 8589 KB)

Throughput Servicing Time Allocation of Hybrid Storage System Based on Client Grouping Mechanism

doi: 10.1049/cje.2018.11.002

1.
State Key Laboratory of Software Development Environment, Beijing 100191, China;
2.
School of Computer Science and Engineering, Beihang University, Beijing 100191, China;
3.
School of Communication Science, Beijing Language and Culture University, Beijing 100083, China;
4.
School of Information Science and Technology, Hebei Agricultural University, Baoding 071001, China

Funds: This work is supported by the National Key R&D Program of China (No.2018YFB0203901, No.2018YFB0203900), the National Natural Science Foundation of China (No.61370059, No.61772053), the Fund of the State Key Laboratory of Software Development Environment (No.SKLSDE-2017ZX-10).

Received Date: 2016-11-07
Rev Recd Date: 2017-09-19
Publish Date: 2019-01-10

Abstract

Abstract

The fair division theory has emerged as a promising approach for the throughput allocation of hybrid storage system. While most of them cause the unfair allocation of the throughput servicing time due to taking no consideration of clients' request IO latencies. We propose one Servicing time allocation method based on the client grouping mechanism(STCG), STCG establishes fair allocation policies based on clients' workload weights, which can achieve a fair throughput servicing time allocation, and can maximize the resource utilization. The experimental result shows that STCG's allocation enjoys fair properties in each client group, and compared with the method proposd recently, STCG can improve the resource utilization about 12%-330%.
- Hybrid storage system,
- Throughput servicing time,
- Fair allocation,
- Client grouping

FullText(HTML)

References(26)

References

Z.S. Huo, L.M. Xiao, Q.L. Zhong, et al., "Mbfs:A parallel metadata search method based on bloomfilter using mapreduce for large-scale file systems", Journal of Supercomputing, Vol.72, No.8, pp.3006-3032, 2016.

H. Wang and P. J. Varman, "Balancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation", Proc. of the 12th USENIX Conference on File and Storage Technologies, Santa Clara, California, USA, Vol.14, pp.229-242, 2014.

Z.S. Huo, L.M. Xiao, Q.L. Zhong, et al., "A metadata cooperative caching architecture based on SSD and DRAM for file systems", Proc. of the 15th International Conference on Algorithms and Architectures for Parallel Processing, Zhangjiajie, Hunan, China, Vol.9529, pp.31-51, 2015.

T. Harter, D. Borthakur, S. Dong, et al., "Analysis of hdfs under hbase:A facebook messages case study", Proc. of the 12th USENIX Conference on File and Storage Technologies, Santa Clara, California, USA, Vol.14, pp.199-212, 2014.

A. Ghodsi, M. Zaharia, B. Hindman, et al., "Dominant resource fairness:Fair allocation of multiple resource types", Proc. of the 8th USENIX Symposium on Network System Design and Implementation, Boston, MA, USA, Vol.11, pp.323-336, 2011.

A.D. Procaccia, "Cake cutting:Not just child's play", Communications of the ACM, Vol.56, No.7, pp.78-87, 2013.

C. Joe-Wong, S. Sen, T. Lan, et al., "Multiresource allocation:Fairness-efficiency tradeoffs in a unifying framework", IEEE/ACM Transactions on Networking, Vol.21, No.6, pp.1785-1798, 2013.

W. Wang, B. Liang and B. Li, "Multi-resource fair allocation in heterogeneous cloud computing systems", IEEE Transactions on Parallel and Distributed Systems, Vol.26, No.10, pp.2822-2835, 2015.

P. Varman and H. Wang, "Brief announcement:Fairnessefficiency tradeoffs in tiered storage allocation", Proc. of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, Prague, Czech Republic, pp.208-210, 2014.

D.C. Parkes, A.D. Procaccia and N. Shah, "Beyond dominant resource fairness:Extensions, limitations, and indivisibilities", Proc. of the 13th ACM Conference on Electronic Commerce, Valencia, Spain, Vol.3, pp.808-825, 2012.

C.A. Waldspurger and W.E. Weihl, "Lottery scheduling:Flexible proportional-share resource management", Proc. of the 1st USENIX Conference on Operating Systems Design and Implementation, Monterey, California, USA, pp.1-11, 1994.

W. Jin, J.S. Chase and J. Kaur, "Interposed proportional sharing for a storage service utility", ACM SIGMETRICS Performance Evaluation Review, Vol.32, No.1, pp.37-48, 2004.

C.R. Lumb, J. Schindler, G.R. Ganger, et al., "Towards higher disk head utilization:extracting free bandwidth from busy disk drives", Proc. of the 4th conference on Symposium on Operating System Design and Implementation, San Diego, CA, United states, Vol.4, pp.8-38, 2000.

I. Stoica, et al., "Duality between resource reservation and proportional share resource allocation", Proc. of the Electronic Imaging International Society for Optics and Photonics, Orlando, Florida, USA, pp.207-214, 1997.

A. Gulati, G. Shanmuganathan, X. Zhang, et al., "Demand based hierarchical QOS using storage resource pools", Proc. of the Usenix Conference on Technical Conference, Boston, Massachusetts, USA, pp.1-13, 2012.

A. Gulati, A. Merchant and P.J. Varman, "Mclock:Handling throughput variability for hypervisor io scheduling", Proc. of the 9th USENIX Conference on Operating Systems Design and Implementation, Berkeley, CA, USA, pp.1-7, 2013.

C. Li, I. Goiri, A. Bhattacharjee, et al., "Quantifying and improving i/o predictability in virtualized systems", Proc. of the IEEE/ACM 21st International Symposium on Quality of Service, Montreal, Quebec, Canada, pp.1-6, 2013.

A. Ghodsi, V. Sekar, M. Zaharia, et al., "Multi-resource fair queueing for packet processing", ACM SIGCOMM Computer Communication Review, Vol.42, No.4, pp.1-12, 2012.

D. Dolev, D.G. Feitelson, J.Y. Halpern, et al., "No justied complaints:On fair sharing of multiple resources", Proc. of the 3rd Innovations in Theoretical Computer Science Conference, Berkeley, California, UAS, pp.68-75, 2012.

A. Gutman and N. Nisan, "Fair allocation without trade", Proc. of the 11th International Conference on Autonomous Agents and Multiagent Systems, Valencia, Spain, Vol.2, pp.719-728, 2012.

Z.S. Huo, L.M. Xiao, Q.L. Zhong, et al., "Hybrid storage throughput allocation among multiple clients in heterogeneous data center", Proc. of the 17th IEEE International Conference on High Performance Computing and Communications, New York, USA, pp.140-147, 2015.

R. McDougall and J. Mauro, "Filebench", available at http://www.nfsv4bat.org/Documents/nasconf/2004/fiLlebench.pdf,2016-7-16.

Y. Liu, R. Figueiredo, D. Clavijo, et al., "Towards simulation of parallel file system scheduling algorithms with pfssim", Proc. of the 7th IEEE International Workshop on Storage Network Architectures and Parallel I/O, Denver, CO, USA, pp.1-9, 2011.

S.P. Council, "Spc I/O traces", available at http://www.traces.cs.umass.edu/index.php/storage/storage,2007-7-1.

S. Kavalanekar, B. Worthington, Q. Zhang, et al., "Characterization of storage workload traces from production windows servers", Proc. of the 2008 IEEE International Symposium on Workload Characterization, Seattle, WA, USA, pp.119-128, 2008.

H. Wang and P. Varman, "Time-based bandwidth allocation for heterogeneous storage", Proc. of the 13th Joint International Conference on Measurement and Modeling of Computer Systems, Antibes, Juan-les-Pins, France, Vol.44, pp.411-413, 2016.

Relative Articles

Supplements(0)

Cited By

Proportional views