Cost analysis of erasure coding for exa-scale storage

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 cod...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of supercomputing Vol. 75; no. 8; pp. 4638 - 4656
Main Authors Kim, Dong-Oh, Kim, Hong-Yeon, Kim, Young-Kyun, Kim, Jeong-Joon
Format Journal Article
LanguageEnglish
Published New York Springer US 01.08.2019
Springer Nature B.V
Subjects
Coding
Compilers
Computer Science
Cost analysis
Distribution costs
Interpreters
Mathematical analysis
Parity
Performance degradation
Processor Architectures
Programming Languages
Servers
scale storage
Degradation factor
ExSTorus
Parity calculation cost
FS
Erasure coding
Exa
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-018-2663-4