TY - JOUR
T1 - CEA
T2 - A Cyclic Expansion Algorithm for data migration in parallel video servers
AU - Li, Mingfu
AU - Yang, Hsun Hao
PY - 2012/7
Y1 - 2012/7
N2 - Parallel video servers can achieve highly storage-saving and granularly load-balancing, but they suffer from a system expansion problem. As the number of users continuously increases, the system inevitably needs to expand the number of video servers. However, the expansion of a parallel video server system is not as simple as that of a replicated video server system. Hence, this work develops an efficient expansion algorithm, called the Cyclic Expansion Algorithm (CEA), for parallel video servers. The proposed CEA algorithm has several good features. First, the data layout of each video content exhibits periodicity. Consequently, the meta-data size of each video and the complexity of the CEA algorithm are reduced. Second, the number of required data movements during a system expansion is optimized. Third, the total number of required XOR recomputations for updating parity blocks during an expansion is also minimized. Additionally, the new CEA can be applied to a variety of distributed storage systems, such as the cloud-based storage systems using striping and parity check techniques.
AB - Parallel video servers can achieve highly storage-saving and granularly load-balancing, but they suffer from a system expansion problem. As the number of users continuously increases, the system inevitably needs to expand the number of video servers. However, the expansion of a parallel video server system is not as simple as that of a replicated video server system. Hence, this work develops an efficient expansion algorithm, called the Cyclic Expansion Algorithm (CEA), for parallel video servers. The proposed CEA algorithm has several good features. First, the data layout of each video content exhibits periodicity. Consequently, the meta-data size of each video and the complexity of the CEA algorithm are reduced. Second, the number of required data movements during a system expansion is optimized. Third, the total number of required XOR recomputations for updating parity blocks during an expansion is also minimized. Additionally, the new CEA can be applied to a variety of distributed storage systems, such as the cloud-based storage systems using striping and parity check techniques.
KW - Algorithm
KW - Data migration
KW - Fault-tolerant computing
KW - Load balancing
KW - Parallel video server
KW - System expansion
UR - http://www.scopus.com/inward/record.url?scp=84861190244&partnerID=8YFLogxK
U2 - 10.1016/j.jpdc.2012.03.002
DO - 10.1016/j.jpdc.2012.03.002
M3 - 文章
AN - SCOPUS:84861190244
SN - 0743-7315
VL - 72
SP - 868
EP - 879
JO - Journal of Parallel and Distributed Computing
JF - Journal of Parallel and Distributed Computing
IS - 7
ER -