earticle

논문검색

A Data Placement Algorithm for Data Intensive Applications in Cloud

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Data Correlation Calculation
 3. Offline Data Placement Algorithm at Initial Stage
 4. PSO-Based Strategy for Data-Group Allocation
 5. Online Data Placement Algorithm at Runtime Stage
 6. Simulation and Results Analysis
 7. Conclusions and Future Work
 Acknowledgements
 References

저자정보

  • Qing Zhao Tianjin University of Science and Technology, Tianjin China
  • Congcong Xiong Tianjin University of Science and Technology, Tianjin China
  • Kunyu Zhang TROILA Development CO.,Ltd, Tianjin China
  • Yang Yue TROILA Development CO.,Ltd, Tianjin China
  • Jucheng Yang Tianjin University of Science and Technology, Tianjin China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.