Paper Info
Title
EOP: an efficient object placement and location algorithm for OBS cluster
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.
Year
DOI
Venue
2007
10.1007/978-3-540-72905-1_20
ICA3PP
Keywords
Field
DocType
rebalance data objects distribution,dynamic interval mapping method,location algorithm,parallel storage system,efficient algorithm,capability weight,eop algorithm,new generation storage system,data file,efficient object placement,obs cluster,o throughput,object-based storage system,simulation experiment,storage system
Computer science,Computer data storage,Massively parallel,Parallel computing,Algorithm,Hash function,Throughput,Data objects,Data file,Distributed computing
Conference
Volume
ISSN
Citations 
4494
0302-9743
0
PageRank 
References 
Authors
0.34
7
4
Name
Order
Citations
PageRank
Changsheng Xie1256.27
Xu Li292.22
Qinqi Wei311.36
Qiang Cao459357.50