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...
Gespeichert in:
| Veröffentlicht in: | The Journal of supercomputing 2019-08, Vol.75 (8), p.4638-4656 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4656 |
|---|---|
| container_issue | 8 |
| container_start_page | 4638 |
| container_title | The Journal of supercomputing |
| container_volume | 75 |
| creator | Kim, Dong-Oh Kim, Hong-Yeon Kim, Young-Kyun Kim, Jeong-Joon |
| description | 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. |
| doi_str_mv | 10.1007/s11227-018-2663-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2288804341</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2288804341</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-a5b592f70c2fdd424a807dfb21db945767854f2839a9313dc3514ff8a7ba8b553</originalsourceid><addsrcrecordid>eNp1kEFLAzEQhYMoWKs_wFvAc3QySZrsUYpaoeBFzyG7m5SW2tTMFuy_N2UFT57m8r7Hm4-xWwn3EsA-kJSIVoB0AmczJfQZm0hjlQDt9DmbQIMgnNF4ya6INgCglVUTZuaZBh52YXukNfGceCyBDiXyLvfr3YqnXHj8DoK6sI2chlzCKl6zixS2FG9-75R9PD-9zxdi-fbyOn9cik6ZZhDBtKbBZKHD1PcadXBg-9Si7NtGGzuzdVFCp5rQKKn6Skmdkgu2Da41Rk3Z3di7L_nrEGnwm3wodSx5ROdcfULLmpJjqiuZqMTk92X9GcrRS_AnO36046sdf7LjdWVwZKhmd6tY_pr_h34A7Cdl4w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2288804341</pqid></control><display><type>article</type><title>Cost analysis of erasure coding for exa-scale storage</title><source>Springer Online Journals Complete</source><creator>Kim, Dong-Oh ; Kim, Hong-Yeon ; Kim, Young-Kyun ; Kim, Jeong-Joon</creator><creatorcontrib>Kim, Dong-Oh ; Kim, Hong-Yeon ; Kim, Young-Kyun ; Kim, Jeong-Joon</creatorcontrib><description>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.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-018-2663-4</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Coding ; Compilers ; Computer Science ; Cost analysis ; Distribution costs ; Interpreters ; Mathematical analysis ; Parity ; Performance degradation ; Processor Architectures ; Programming Languages ; Servers</subject><ispartof>The Journal of supercomputing, 2019-08, Vol.75 (8), p.4638-4656</ispartof><rights>The Author(s) 2018</rights><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-a5b592f70c2fdd424a807dfb21db945767854f2839a9313dc3514ff8a7ba8b553</citedby><cites>FETCH-LOGICAL-c359t-a5b592f70c2fdd424a807dfb21db945767854f2839a9313dc3514ff8a7ba8b553</cites><orcidid>0000-0001-9576-3163 ; 0000-0002-0125-1907</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11227-018-2663-4$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11227-018-2663-4$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Kim, Dong-Oh</creatorcontrib><creatorcontrib>Kim, Hong-Yeon</creatorcontrib><creatorcontrib>Kim, Young-Kyun</creatorcontrib><creatorcontrib>Kim, Jeong-Joon</creatorcontrib><title>Cost analysis of erasure coding for exa-scale storage</title><title>The Journal of supercomputing</title><addtitle>J Supercomput</addtitle><description>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.</description><subject>Coding</subject><subject>Compilers</subject><subject>Computer Science</subject><subject>Cost analysis</subject><subject>Distribution costs</subject><subject>Interpreters</subject><subject>Mathematical analysis</subject><subject>Parity</subject><subject>Performance degradation</subject><subject>Processor Architectures</subject><subject>Programming Languages</subject><subject>Servers</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><recordid>eNp1kEFLAzEQhYMoWKs_wFvAc3QySZrsUYpaoeBFzyG7m5SW2tTMFuy_N2UFT57m8r7Hm4-xWwn3EsA-kJSIVoB0AmczJfQZm0hjlQDt9DmbQIMgnNF4ya6INgCglVUTZuaZBh52YXukNfGceCyBDiXyLvfr3YqnXHj8DoK6sI2chlzCKl6zixS2FG9-75R9PD-9zxdi-fbyOn9cik6ZZhDBtKbBZKHD1PcadXBg-9Si7NtGGzuzdVFCp5rQKKn6Skmdkgu2Da41Rk3Z3di7L_nrEGnwm3wodSx5ROdcfULLmpJjqiuZqMTk92X9GcrRS_AnO36046sdf7LjdWVwZKhmd6tY_pr_h34A7Cdl4w</recordid><startdate>20190801</startdate><enddate>20190801</enddate><creator>Kim, Dong-Oh</creator><creator>Kim, Hong-Yeon</creator><creator>Kim, Young-Kyun</creator><creator>Kim, Jeong-Joon</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-9576-3163</orcidid><orcidid>https://orcid.org/0000-0002-0125-1907</orcidid></search><sort><creationdate>20190801</creationdate><title>Cost analysis of erasure coding for exa-scale storage</title><author>Kim, Dong-Oh ; Kim, Hong-Yeon ; Kim, Young-Kyun ; Kim, Jeong-Joon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-a5b592f70c2fdd424a807dfb21db945767854f2839a9313dc3514ff8a7ba8b553</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Coding</topic><topic>Compilers</topic><topic>Computer Science</topic><topic>Cost analysis</topic><topic>Distribution costs</topic><topic>Interpreters</topic><topic>Mathematical analysis</topic><topic>Parity</topic><topic>Performance degradation</topic><topic>Processor Architectures</topic><topic>Programming Languages</topic><topic>Servers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Dong-Oh</creatorcontrib><creatorcontrib>Kim, Hong-Yeon</creatorcontrib><creatorcontrib>Kim, Young-Kyun</creatorcontrib><creatorcontrib>Kim, Jeong-Joon</creatorcontrib><collection>Springer Nature OA/Free Journals</collection><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kim, Dong-Oh</au><au>Kim, Hong-Yeon</au><au>Kim, Young-Kyun</au><au>Kim, Jeong-Joon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Cost analysis of erasure coding for exa-scale storage</atitle><jtitle>The Journal of supercomputing</jtitle><stitle>J Supercomput</stitle><date>2019-08-01</date><risdate>2019</risdate><volume>75</volume><issue>8</issue><spage>4638</spage><epage>4656</epage><pages>4638-4656</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>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.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11227-018-2663-4</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0001-9576-3163</orcidid><orcidid>https://orcid.org/0000-0002-0125-1907</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0920-8542 |
| ispartof | The Journal of supercomputing, 2019-08, Vol.75 (8), p.4638-4656 |
| issn | 0920-8542 1573-0484 |
| language | eng |
| recordid | cdi_proquest_journals_2288804341 |
| source | Springer Online Journals Complete |
| subjects | Coding Compilers Computer Science Cost analysis Distribution costs Interpreters Mathematical analysis Parity Performance degradation Processor Architectures Programming Languages Servers |
| title | Cost analysis of erasure coding for exa-scale storage |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T15%3A30%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Cost%20analysis%20of%20erasure%20coding%20for%20exa-scale%20storage&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Kim,%20Dong-Oh&rft.date=2019-08-01&rft.volume=75&rft.issue=8&rft.spage=4638&rft.epage=4656&rft.pages=4638-4656&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-018-2663-4&rft_dat=%3Cproquest_cross%3E2288804341%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2288804341&rft_id=info:pmid/&rfr_iscdi=true |