对象存储系统中的柔性对象分布策略  

Hybrid object allocation policy for object storage systems

作　　者：王芳[1] 张顺达[1] 冯丹[1] 曾令仿[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2007年第3期46-48,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家重点基础研究发展计划资助项目(2004CB318201);国家自然科学基金资助项目(60303032)

摘　　要：为了使对象存储系统在处理不同大小文件时兼顾并行性和负载均衡,提出一种能够结合哈希算法和分片算法的优点,同时尽量避免其缺点的柔性分布算法.柔性分布算法将大小文件的边界值界定为512 Kbyte,小文件直接映射成一个对象并使用哈希策略映射到一个设备中;大文件分割成多个对象,分别放置在不同的设备里.实验结果显示:柔性分布算法在不同规模的系统中开销最小,且性能受设备数增加的影响较小.In order to satisfy both load balance and parallel operation when dealing with file requests of different size in object storage system, a hybrid mapping algorithm is proposed which is characterized by hashing and fragment-mapping approaches and avoids their shortcomings. The bound of big or small file was set as 512 Kbyte. Small files are mapped though hashing function directly to one object storage device （OSD）, while big files are mapped to multiple objects and stored onto OSDs. Experiment results indicate that this hybrid algorithm has the lowest workload and lest influence when device number increasing.

关 键 词：对象存储系统 对象分布策略 负载均衡 

分 类 号：TP302.1[自动化与计算机技术—计算机系统结构]