A Data Placement Strategy Based on Dynamic Interval Mapping And Greedy Algorithm

被引：0

作者：

Ge Junwei ^{[1
]}

Wang Zhangtao ^{[2
]}

Fang Yiqiu ^{[2
]}

机构：

[1] Lib Chongqing Univ Posts & Telecommun, Chongqing, Peoples R China

[2] Chongqing Univ Posts & Telecommun, Coll Comp Sci & Technol, Chongqing, Peoples R China

来源：

2012 4TH INTERNATIONAL CONFERENCE ON ENVIRONMENTAL SCIENCE AND INFORMATION APPLICATION TECHNOLOGY (ESIAT 2012) | 2013年 / 14卷

关键词：

Cloud storage; Greedy algorithm; Dynamic interval mapping; Interval linked list;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In the cloud storage system, the data placement strategy should be Highly scalable, fair, and the searching of data object should be fast. But, Current data placement strategy could not match these requirements very well . In this paper we realize a data placement strategy based on greedy algorithm and dynamic interval mapping algorithm. Experiment proves that this data placement strategy ensures data objects' distribution fair and retractable, and also ensures data objects are located rapidly

引用

页码：589 / 594

页数：6