Smash: Flexible, Fast, and Resource-efficient Placement and Lookup of Distributed Storage

Author:

Liu Yi1ORCID,Shi Shouqian1ORCID,Xie Minghao1ORCID,Litz Heiner1ORCID,Qian Chen1ORCID

Affiliation:

1. University of California, Santa Cruz, Santa Cruz, CA, USA

Funder

NSF

Publisher

ACM

Reference5 articles.

1. https://docs.ceph.com/. https://docs.ceph.com/.

2. Smash: Flexible, Fast, and Resource-efficient Placement and Lookup of Distributed Storage

3. Shi , S. , and Qian , C. Ludo hashing: Compact, Fast , and Dynamic Key-Value Lookups for Practical Network Systems. Proceedings of the ACM on Measurement and Analysis of Computing Systems 4 , 2 ( 2020 ), 1--32. Shi, S., and Qian, C. Ludo hashing: Compact, Fast, and Dynamic Key-Value Lookups for Practical Network Systems. Proceedings of the ACM on Measurement and Analysis of Computing Systems 4, 2 (2020), 1--32.

4. Wang , L. , Zhang , Y. , Xu , J. , and Xue , G . MAPX: Controlled Data Migration in the Expansion of Decentralized Object-Based Storage Systems. In 18th USENIX Conference on File and Storage Technologies (FAST 20) ( 2020 ), pp. 1 -- 11 . Wang, L., Zhang, Y., Xu, J., and Xue, G. MAPX: Controlled Data Migration in the Expansion of Decentralized Object-Based Storage Systems. In 18th USENIX Conference on File and Storage Technologies (FAST 20) (2020), pp. 1--11.

5. Weil , S. A. , Brandt , S. A. , Miller , E. L. , and Maltzahn , C . Crush: Controlled, Scalable , Decentralized Placement of Replicated Data. In SC'06: Proceedings of the 2006 ACM/IEEE Conference on Supercomputing ( 2006 ), IEEE, pp. 31 -- 31 . Weil, S. A., Brandt, S. A., Miller, E. L., and Maltzahn, C. Crush: Controlled, Scalable, Decentralized Placement of Replicated Data. In SC'06: Proceedings of the 2006 ACM/IEEE Conference on Supercomputing (2006), IEEE, pp. 31--31.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3