EOP: an efficient object placement and location algorithm for OBS cluster

  • Authors:
  • Changsheng Xie;Xu Li;Qinqi Wei;Qiang Cao

  • Affiliations:
  • Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, Hubei, China;Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, Hubei, China;Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, Hubei, China;Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, Hubei, China

  • Venue:
  • ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new generation storage system which called Object-Based Storage system (OBS) is emerging as the foundation for building massively parallel storage system. In the OBS, data files are usually stripped into multiple objects across OBS's nodes to improve the system I/O throughput. A fundamental problem that confronts OBS is to efficiently place and locate objects in the dynamically changing environment. In this paper, we develop EOP: an efficient algorithm based on dynamic interval mapping method for object placement and lookup services. The algorithm provides immediately rebalance data objects distribution with the nodes' addition, deletion and capability weight changing. Results from theoretical analysis, simulation experiments demonstrate the effectiveness of our EOP algorithm.