摘要
针对Ceph存储系统CRUSH算法对高相关性的小文件数据对象落入同一个存储节点的问题,提出基于温度因子的CRUSH改进算法。将改进算法和原始算法进行实验对比,结果验证算法的有效性,所提出的算法能够通过计算用户写请求访问集群中某个节点的频率,动态增加该节点的温度因子,利用温度因子对原始CRUSH算法进行加权运算,得出更适合的存储节点。研究结果表明,改进的CRUSH算法能有效解决对小文件存储所引起的负载均衡问题;避免造成单一节点I/O繁忙和网络拥堵并不会影响整体集群的负载均衡。
In Ceph storage,an improved CRUSH algorithm with Temperature factor,is proposed to resolve the problem that high correlation small data objects fall into single storage node. Based on the improved algorithm and the original algorithm experimental contrast,results demonstrate the effectiveness of the improved algorithm. The proposed algorithm can calculate user write- request frequency of a node in the cluster,and increase the node＇s temperature dynamically,and use the temperature factor on the original CRUSH weighted,calculate more suitable storage nodes. Research indicates that improved CRUSH algorithm can effectively resolve backend storage I / O busy problems caused by the storage of small files and does not affect the load- balanced of entire cluster.
出处
《成都信息工程学院学报》
2015年第6期563-567,共5页
Journal of Chengdu University of Information Technology
基金
省科技厅科技支撑计划资助项目(2012SZ0070)
