Author(s)

Qiang Xu^*, Zhengquan Xu, Tao Wang

State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, China.

With the development of Computerized Business Application, the amount of data is increasing exponentially. Cloud computing provides high performance computing resources and mass storage resources for massive data processing. In distributed cloud computing systems, data intensive computing can lead to data scheduling between data centers. Reasonable data placement can reduce data scheduling between the data centers effectively, and improve the data acquisition efficiency of users. In this paper, the mathematical model of data scheduling between data centers is built. By means of the global optimization ability of the genetic algorithm, generational evolution produces better approximate solution, and gets the best approximation of the data placement at last. The experimental results show that genetic algorithm can effectively work out the approximate optimal data placement, and minimize data scheduling between data centers.

Cloud Computing, Data Placement, Genetic Algorithm, Data Scheduling

Xu, Q. , Xu, Z. and Wang, T. (2015) A Data-Placement Strategy Based on Genetic Algorithm in Cloud Computing. International Journal of Intelligence Science, 5, 145-157. doi: 10.4236/ijis.2015.53013.