TY - GEN
T1 - A study on data placement of extensible parallel storage system
AU - Zhang, Hu
AU - Wu, Weiguo
AU - Dong, Xiaoshe
AU - Qian, Depei
AU - Dai, Luogeng
PY - 2007
Y1 - 2007
N2 - For a parallel file system which employs Modulo Function as their data placement mechanism, a rebalancing operation must be taken after new storage nodes are added in it. The rebalancing operation moves data among system nodes for efficiently using of system resource. However, most data moves are between old nodes and useless to achieving storage balance, and therefore waste plenty of CPU time and I/O bandwidth. In this paper, two data placement mechanisms, Ordinal-selection and Improved Ordinal-selection, are presented to settle this problem, both of the mechanisms place data according to the simulation results of multi times rebalancing operations and make the storage system more flexible to changes in number of system nodes. The analysis and simulation results show that: both of the mechanisms can achieve zero-ineffectual move ratio. As a tradeoff, their parallel degrees are lower than that of Modulo Function, and the Improved Ordinal-selection is little better than Ordinal-selection.
AB - For a parallel file system which employs Modulo Function as their data placement mechanism, a rebalancing operation must be taken after new storage nodes are added in it. The rebalancing operation moves data among system nodes for efficiently using of system resource. However, most data moves are between old nodes and useless to achieving storage balance, and therefore waste plenty of CPU time and I/O bandwidth. In this paper, two data placement mechanisms, Ordinal-selection and Improved Ordinal-selection, are presented to settle this problem, both of the mechanisms place data according to the simulation results of multi times rebalancing operations and make the storage system more flexible to changes in number of system nodes. The analysis and simulation results show that: both of the mechanisms can achieve zero-ineffectual move ratio. As a tradeoff, their parallel degrees are lower than that of Modulo Function, and the Improved Ordinal-selection is little better than Ordinal-selection.
UR - https://www.scopus.com/pages/publications/46749137170
U2 - 10.1109/ICIS.2007.46
DO - 10.1109/ICIS.2007.46
M3 - 会议稿件
AN - SCOPUS:46749137170
SN - 0769528414
SN - 9780769528410
T3 - Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007
SP - 610
EP - 615
BT - Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007
PB - IEEE Computer Society
T2 - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007, In conjunction with 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007
Y2 - 11 July 2007 through 13 July 2007
ER -