Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems
In this paper, we present a novel coding scheme that can tolerate up to two-disk failures, satisfying the RAID-6 property. Our coding scheme, Code-M, is a non-MDS (Maximum Distance Separable, tolerating maximum failures with a given amount of redundancy) code that is optimized by trading rate for fa...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 60 |
---|---|
container_issue | |
container_start_page | 51 |
container_title | |
container_volume | |
creator | Shenggang Wan Qiang Cao Changsheng Xie Eckart, B Xubin He |
description | In this paper, we present a novel coding scheme that can tolerate up to two-disk failures, satisfying the RAID-6 property. Our coding scheme, Code-M, is a non-MDS (Maximum Distance Separable, tolerating maximum failures with a given amount of redundancy) code that is optimized by trading rate for fast recovery times. Code-M is lowest density and its parity chain length is fixed at 2C - 1 for a given number of columns in a strip-set C. The rate of Code-M, or percentage of disk space occupied by non-parity data, is (C - 1)/C. We perform theoretical analysis and evaluation of the coding scheme under different configurations. Our theoretical analysis shows that Code-M has favorable reconstruction times compared to RDP, another well-established RAID-6 code. The quantitative comparisons of Code-M against RDP demonstrate recovery performance improvement by a factor of up to 5.18 under single disk failure and 2.8 under double failures using the same number of disks. Overall, Code-M is a RAID-6 type code supporting fast recovery with reduced I/O complexity. |
doi_str_mv | 10.1109/DSN.2010.5545009 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5545009</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5545009</ieee_id><sourcerecordid>5545009</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-23b8438715dc796d23f6a30cb17905a7804b12bc647068495e17f02a906b80a63</originalsourceid><addsrcrecordid>eNpFkMlOwzAYhM0mUUrvSFz8Ai6_d5sbatmkFg6Fc-UkDgSaOLJdUN-eICoxl9FoRt9hELqgMKUU7NV89TRlMCQphQSwB-iMCiaElkDlIRoxKg3hlumj_wL0MRpRyYGAMfYUTVL6gEFCMqHVCHWzUHmyvMY3uAsdWc5X2EeXttHjcmhwKt9963EOOG37PsSMa5cyjr4MXz7ucB1Di7f97yB_B1I16XNYNJsBkHDT4ZRDdG8DZ5eyb9M5OqndJvnJ3sfo9e72ZfZAFs_3j7ObBWmolpkwXhjBjaayKrVVFeO1chzKgmoL0mkDoqCsKJXQoIyw0lNdA3MWVGHAKT5Gl3_cxnu_7mPTurhb73_jP1kwW9Q</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Shenggang Wan ; Qiang Cao ; Changsheng Xie ; Eckart, B ; Xubin He</creator><creatorcontrib>Shenggang Wan ; Qiang Cao ; Changsheng Xie ; Eckart, B ; Xubin He</creatorcontrib><description>In this paper, we present a novel coding scheme that can tolerate up to two-disk failures, satisfying the RAID-6 property. Our coding scheme, Code-M, is a non-MDS (Maximum Distance Separable, tolerating maximum failures with a given amount of redundancy) code that is optimized by trading rate for fast recovery times. Code-M is lowest density and its parity chain length is fixed at 2C - 1 for a given number of columns in a strip-set C. The rate of Code-M, or percentage of disk space occupied by non-parity data, is (C - 1)/C. We perform theoretical analysis and evaluation of the coding scheme under different configurations. Our theoretical analysis shows that Code-M has favorable reconstruction times compared to RDP, another well-established RAID-6 code. The quantitative comparisons of Code-M against RDP demonstrate recovery performance improvement by a factor of up to 5.18 under single disk failure and 2.8 under double failures using the same number of disks. Overall, Code-M is a RAID-6 type code supporting fast recovery with reduced I/O complexity.</description><identifier>ISSN: 1530-0889</identifier><identifier>ISBN: 1424475007</identifier><identifier>ISBN: 9781424475001</identifier><identifier>EISSN: 2158-3927</identifier><identifier>EISBN: 1424475015</identifier><identifier>EISBN: 9781424475018</identifier><identifier>EISBN: 142447499X</identifier><identifier>EISBN: 9781424474998</identifier><identifier>DOI: 10.1109/DSN.2010.5545009</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer networks ; Costs ; Disk drives ; Helium ; Performance analysis ; Performance evaluation ; Redundancy</subject><ispartof>2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN), 2010, p.51-60</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5545009$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5545009$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Shenggang Wan</creatorcontrib><creatorcontrib>Qiang Cao</creatorcontrib><creatorcontrib>Changsheng Xie</creatorcontrib><creatorcontrib>Eckart, B</creatorcontrib><creatorcontrib>Xubin He</creatorcontrib><title>Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems</title><title>2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)</title><addtitle>DSN</addtitle><description>In this paper, we present a novel coding scheme that can tolerate up to two-disk failures, satisfying the RAID-6 property. Our coding scheme, Code-M, is a non-MDS (Maximum Distance Separable, tolerating maximum failures with a given amount of redundancy) code that is optimized by trading rate for fast recovery times. Code-M is lowest density and its parity chain length is fixed at 2C - 1 for a given number of columns in a strip-set C. The rate of Code-M, or percentage of disk space occupied by non-parity data, is (C - 1)/C. We perform theoretical analysis and evaluation of the coding scheme under different configurations. Our theoretical analysis shows that Code-M has favorable reconstruction times compared to RDP, another well-established RAID-6 code. The quantitative comparisons of Code-M against RDP demonstrate recovery performance improvement by a factor of up to 5.18 under single disk failure and 2.8 under double failures using the same number of disks. Overall, Code-M is a RAID-6 type code supporting fast recovery with reduced I/O complexity.</description><subject>Computer networks</subject><subject>Costs</subject><subject>Disk drives</subject><subject>Helium</subject><subject>Performance analysis</subject><subject>Performance evaluation</subject><subject>Redundancy</subject><issn>1530-0889</issn><issn>2158-3927</issn><isbn>1424475007</isbn><isbn>9781424475001</isbn><isbn>1424475015</isbn><isbn>9781424475018</isbn><isbn>142447499X</isbn><isbn>9781424474998</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkMlOwzAYhM0mUUrvSFz8Ai6_d5sbatmkFg6Fc-UkDgSaOLJdUN-eICoxl9FoRt9hELqgMKUU7NV89TRlMCQphQSwB-iMCiaElkDlIRoxKg3hlumj_wL0MRpRyYGAMfYUTVL6gEFCMqHVCHWzUHmyvMY3uAsdWc5X2EeXttHjcmhwKt9963EOOG37PsSMa5cyjr4MXz7ucB1Di7f97yB_B1I16XNYNJsBkHDT4ZRDdG8DZ5eyb9M5OqndJvnJ3sfo9e72ZfZAFs_3j7ObBWmolpkwXhjBjaayKrVVFeO1chzKgmoL0mkDoqCsKJXQoIyw0lNdA3MWVGHAKT5Gl3_cxnu_7mPTurhb73_jP1kwW9Q</recordid><startdate>201006</startdate><enddate>201006</enddate><creator>Shenggang Wan</creator><creator>Qiang Cao</creator><creator>Changsheng Xie</creator><creator>Eckart, B</creator><creator>Xubin He</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201006</creationdate><title>Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems</title><author>Shenggang Wan ; Qiang Cao ; Changsheng Xie ; Eckart, B ; Xubin He</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-23b8438715dc796d23f6a30cb17905a7804b12bc647068495e17f02a906b80a63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Computer networks</topic><topic>Costs</topic><topic>Disk drives</topic><topic>Helium</topic><topic>Performance analysis</topic><topic>Performance evaluation</topic><topic>Redundancy</topic><toplevel>online_resources</toplevel><creatorcontrib>Shenggang Wan</creatorcontrib><creatorcontrib>Qiang Cao</creatorcontrib><creatorcontrib>Changsheng Xie</creatorcontrib><creatorcontrib>Eckart, B</creatorcontrib><creatorcontrib>Xubin He</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shenggang Wan</au><au>Qiang Cao</au><au>Changsheng Xie</au><au>Eckart, B</au><au>Xubin He</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems</atitle><btitle>2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)</btitle><stitle>DSN</stitle><date>2010-06</date><risdate>2010</risdate><spage>51</spage><epage>60</epage><pages>51-60</pages><issn>1530-0889</issn><eissn>2158-3927</eissn><isbn>1424475007</isbn><isbn>9781424475001</isbn><eisbn>1424475015</eisbn><eisbn>9781424475018</eisbn><eisbn>142447499X</eisbn><eisbn>9781424474998</eisbn><abstract>In this paper, we present a novel coding scheme that can tolerate up to two-disk failures, satisfying the RAID-6 property. Our coding scheme, Code-M, is a non-MDS (Maximum Distance Separable, tolerating maximum failures with a given amount of redundancy) code that is optimized by trading rate for fast recovery times. Code-M is lowest density and its parity chain length is fixed at 2C - 1 for a given number of columns in a strip-set C. The rate of Code-M, or percentage of disk space occupied by non-parity data, is (C - 1)/C. We perform theoretical analysis and evaluation of the coding scheme under different configurations. Our theoretical analysis shows that Code-M has favorable reconstruction times compared to RDP, another well-established RAID-6 code. The quantitative comparisons of Code-M against RDP demonstrate recovery performance improvement by a factor of up to 5.18 under single disk failure and 2.8 under double failures using the same number of disks. Overall, Code-M is a RAID-6 type code supporting fast recovery with reduced I/O complexity.</abstract><pub>IEEE</pub><doi>10.1109/DSN.2010.5545009</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1530-0889 |
ispartof | 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN), 2010, p.51-60 |
issn | 1530-0889 2158-3927 |
language | eng |
recordid | cdi_ieee_primary_5545009 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Computer networks Costs Disk drives Helium Performance analysis Performance evaluation Redundancy |
title | Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T08%3A10%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Code-M:%20A%20non-MDS%20erasure%20code%20scheme%20to%20support%20fast%20recovery%20from%20up%20to%20two-disk%20failures%20in%20storage%20systems&rft.btitle=2010%20IEEE/IFIP%20International%20Conference%20on%20Dependable%20Systems%20&%20Networks%20(DSN)&rft.au=Shenggang%20Wan&rft.date=2010-06&rft.spage=51&rft.epage=60&rft.pages=51-60&rft.issn=1530-0889&rft.eissn=2158-3927&rft.isbn=1424475007&rft.isbn_list=9781424475001&rft_id=info:doi/10.1109/DSN.2010.5545009&rft_dat=%3Cieee_6IE%3E5545009%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424475015&rft.eisbn_list=9781424475018&rft.eisbn_list=142447499X&rft.eisbn_list=9781424474998&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5545009&rfr_iscdi=true |