TY - GEN
T1 - R2D
T2 - 2017 IEEE International Conference on Applied System Innovation, ICASI 2017
AU - Chen, Min Chun
AU - Hsieh, Yun Shan
AU - Chen, Hsin Hsin
AU - Chen, Yi Hua
AU - Liu, Yun Fei
AU - Huang, Po Chun
AU - Lin, Yu Tsai
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/21
Y1 - 2017/7/21
N2 - Due to the continuous upscaling of the storage capacity and downscaling of the physical size of storage systems, the data reliability problem has become a research highlight. While various redundancy schemes have been proposed to include extra redundant data to ensure that the correct data can be recovered even in the presence of bit errors or bad blocks, they might introduce unexpected performance overheads on data accesses. In particular, in the case of unreliable block devices, as a number of data blocks are grouped together for redundant data computation, even reading a single bad block might require to read out the whole set, including the data blocks and their redundant blocks, to recover the correct data, thereby considerably amplifying the read traffic. On the other hand, the replication scheme does not have such a serious overhead of read amplification, but introduces a serious space overhead to keep multiple copies of the same data. In this work, we propose to integrate redundancy and replication schemes according to the access patterns of different data, which can strike a proper balance between the space and performance overheads. The proposed scheme, 'redundant or replicated data (R2D),' is then verified through experimental studies, where the results are quite encouraging.
AB - Due to the continuous upscaling of the storage capacity and downscaling of the physical size of storage systems, the data reliability problem has become a research highlight. While various redundancy schemes have been proposed to include extra redundant data to ensure that the correct data can be recovered even in the presence of bit errors or bad blocks, they might introduce unexpected performance overheads on data accesses. In particular, in the case of unreliable block devices, as a number of data blocks are grouped together for redundant data computation, even reading a single bad block might require to read out the whole set, including the data blocks and their redundant blocks, to recover the correct data, thereby considerably amplifying the read traffic. On the other hand, the replication scheme does not have such a serious overhead of read amplification, but introduces a serious space overhead to keep multiple copies of the same data. In this work, we propose to integrate redundancy and replication schemes according to the access patterns of different data, which can strike a proper balance between the space and performance overheads. The proposed scheme, 'redundant or replicated data (R2D),' is then verified through experimental studies, where the results are quite encouraging.
UR - https://www.scopus.com/pages/publications/85028578354
UR - https://www.scopus.com/pages/publications/85028578354#tab=citedBy
U2 - 10.1109/ICASI.2017.7988175
DO - 10.1109/ICASI.2017.7988175
M3 - Conference contribution
AN - SCOPUS:85028578354
T3 - Proceedings of the 2017 IEEE International Conference on Applied System Innovation: Applied System Innovation for Modern Technology, ICASI 2017
SP - 1423
EP - 1426
BT - Proceedings of the 2017 IEEE International Conference on Applied System Innovation
A2 - Meen, Teen-Hang
A2 - Lam, Artde Donald Kin-Tak
A2 - Prior, Stephen D.
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 13 May 2017 through 17 May 2017
ER -