Research on the Data Placement Algorithm in Large-Scale Network Storage Systems
Liu Fang · Computer Engineering and Science · 2009
Scalable and reliable data management are the key techniques to implement large-scale network storage systems. It is important to design an even,redundant,and highly available data placement algorithm. Four categories of data placement algorithms are declusterd by different objectives. This paper gives a description of homogenous data placement,non-redundant heterogeneous data placement,redundant heterogeneous data placement and highly available data placement. The problems of the current data placement are discussed. Then some future research issues are summarized.