检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:苗宇豪 范中磊[1] 张墨翟 杨柳 MIAO Yuhao;FAN Zhonglei;ZHANG Modi;YANG Liu(College of Information Engineering,Chang'an University,Xi'an 710064,China)
出 处:《微电子学与计算机》2024年第3期90-97,共8页Microelectronics & Computer
基 金:中央高校基本科研业务费专项(CHD2011TD009)。
摘 要:针对Ceph分布式存储系统中可扩展哈希下的受控复制(Controlled Replication Under Scalable Hashing,CRUSH)数据分布算法导致设备间存储数据容量之差达到40%,进而在数据量大、高并发情况下“热点”成为系统性能瓶颈的问题,本文对CRUSH算法进行深入研究,设计并实现了Writing_Balance算法来对数据分布进行性能优化,以达到消除“热点”所导致的负载失衡以及磁盘利用率过高的问题。通过实验发现,Writing_Balance算法可使“热点”的PG数量分布优化率较之前提升4.4%;磁盘利用率稳定性提高了3%左右;并且在较小输入key空间下对于数据整体均衡度优化也有明显的提升。The Controlled Replication Under Scalable Hashing(CRUSH)data distribution algorithm in Ceph distributed storage system causes the difference of storage data capacity between devices to reach 40%,and the so-called"hot spot"becomes the bottleneck of system performance in the case of large data volume and high concurrency.In this paper,CRUSH algorithm is deeply studied,and Writing is designed and implemented Writing_Balance algorithm is used to optimize the performance of data distribution to eliminate the load imbalance caused by"hot spotst"and the high disk utilization.Writing_Balance algorithm is found through experiments,which can optimize the PG quantity distribution of"hot spotst"to 4.4%compared with storage system that do not use Writing_Balance algorithm.The stability of disk utilization has been improved by about 3%and the overall data balance optimization has also been significantly improved in a small input key space.
关 键 词:Ceph分布式存储 数据分布均衡性 可扩展哈希下的受控复制 数据分布算法
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145