A data placement algorithm for data intensive applications in cloud

12Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Data layout is an important issue which aims at reducing data movements among data centers to improve the efficiency of the entire cloud system. This paper proposes a data-intensive application oriented data layout algorithm. It is based on hierarchical data correlation clustering and the PSO algorithm. The datasets with fixed location have been considered, and both the offline strategy and the online strategy for data layout have been given. As this proposed strategy is aimed at reducing the global amount of data transmissions, and the special permission of the datasets has been introduced, the cost of data transmission can be measured more reasonable. Simulation results show that compared with two classical strategies, our algorithm can reduce the amount of data transmission more effectively.

Cite

CITATION STYLE

APA

Zhao, Q., Xiong, C., Zhang, K., Yue, Y., & Yang, J. (2016). A data placement algorithm for data intensive applications in cloud. International Journal of Grid and Distributed Computing, 9(2), 145–156. https://doi.org/10.14257/ijgdc.2016.9.2.13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free