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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Xie, C., Li, X., Wei, Q., & Cao, Q. (2007). EOP: An efficient object placement and location algorithm for OBS cluster. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4494 LNCS, pp. 222–230). Springer Verlag. https://doi.org/10.1007/978-3-540-72905-1_20
Mendeley helps you to discover research relevant for your work.