ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Cost Analysis of Erasure Coding for Exa-scale Storage
Cited 5 time in scopus Download 11 time Share share facebook twitter linkedin kakaostory
저자
김동오, 김홍연, 김영균, 김정준
발행일
201908
출처
Journal of Supercomputing, v.75 no.8, pp.4638-4656
ISSN
0920-8542
출판사
Springer
DOI
https://dx.doi.org/10.1007/s11227-018-2663-4
협약과제
18HS3900, (ICBMS-총괄) ICBMS(IoT, 클라우드, 빅데이터, 모바일, 정보보호) 핵심 기술 개발 사업 총괄 및 엑사스케일급 클라우드 스토리지 기술 개발, 김영균
초록
With the increasing demand for mass storage, research on exa-scale storage is actively underway. When the scale of storage grows to the exa-scale, the space efficiency becomes very important. To maintain the storage reliability and improve the space efficiency, we have begun to introduce erasure coding instead of replication. However, erasure coding has many I/O performance degradation factors such as Parity Calculation, degraded I/O, Data Distribution cost, etc., whereas the existing research mainly focuses on improving the performance of the Parity Calculation.In this study, we identified the issues and bottlenecks of using erasure coding in real storage. First, we measured the I/O performance of various erasure codes to find the suitable erasure codes for real storage. Next, we analyzed the execution time for each processing step when I/O was performed and the issues when erasure coding was used in storage. Finally, we predicted the cost of EC-based I/O processing in the exa-scale storage and identified the expected problems.
KSP 제안 키워드
Data Distribution, Erasure Codes, Erasure coding, Exa-scale, I/O performance, Mass storage, Space efficiency, Storage reliability, cost analysis, execution time, performance degradation