Stripe Matching and Merging Algorithm-based Redundancy Transition for Locally Repairable Codes
Compared with traditional replication technique, erasure coding is another data redundancy mechanism with lower space overhead at the cost of high repair cost.Locally repairable code is a special kind of erasure code with low repair cost, which is widely deployed in big data storage systems.In order...
Saved in:
Published in | Ji suan ji ke xue Vol. 50; no. 12; p. 89 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | Chinese |
Published |
Chongqing
Guojia Kexue Jishu Bu
01.01.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Compared with traditional replication technique, erasure coding is another data redundancy mechanism with lower space overhead at the cost of high repair cost.Locally repairable code is a special kind of erasure code with low repair cost, which is widely deployed in big data storage systems.In order to accommodate itself to dynamic workload and varying failure rate of sto-rage media, modern storage systems make better trade off between access performance and reliability for erasure coded data by means of redundancy transitions.A redundancy transition method, which selectively matches and merges stripes of specific layout, decouples data placement and redundancy transition, is proposed.Furthermore, it reduces the cross-rack network traffic by designing cost quantification and optimization model.In contrast to those algorithms that designing data placement, the proposed algorithm has almost the same performance but eliminates the constraints on data layout and can be run iteratively.Experiment results show that |
---|---|
AbstractList | Compared with traditional replication technique, erasure coding is another data redundancy mechanism with lower space overhead at the cost of high repair cost.Locally repairable code is a special kind of erasure code with low repair cost, which is widely deployed in big data storage systems.In order to accommodate itself to dynamic workload and varying failure rate of sto-rage media, modern storage systems make better trade off between access performance and reliability for erasure coded data by means of redundancy transitions.A redundancy transition method, which selectively matches and merges stripes of specific layout, decouples data placement and redundancy transition, is proposed.Furthermore, it reduces the cross-rack network traffic by designing cost quantification and optimization model.In contrast to those algorithms that designing data placement, the proposed algorithm has almost the same performance but eliminates the constraints on data layout and can be run iteratively.Experiment results show that |
Author | Du, Qingpeng Wu, Si Xu, Yinlong |
Author_xml | – sequence: 1 givenname: Qingpeng surname: Du fullname: Du, Qingpeng – sequence: 2 givenname: Yinlong surname: Xu fullname: Xu, Yinlong – sequence: 3 givenname: Si surname: Wu fullname: Wu, Si |
BookMark | eNqNir0KwjAURjNU8PcdAs6FpilVRymKgy7q4GS5ba41Em9qkg6-vRV8ADnDd-A7YxaRJYzYSCRJGgu5uAzZzHtdJanMsx4xYtdTcLpFfoBQ3zU1HEjxA7rm62vTWKfD_RlX4FHxI6qOFFD95mcH5HXQlvjNOr63NRjz7osWtIPKIC-sQj9lgxsYj7PfTth8uzkXu7h19tWhD-XDdo76q0xXYikzsZK5_K_6AA6QRjQ |
ContentType | Journal Article |
Copyright | Copyright Guojia Kexue Jishu Bu 2023 |
Copyright_xml | – notice: Copyright Guojia Kexue Jishu Bu 2023 |
DBID | 7SC 8FD JQ2 L7M L~C L~D |
DatabaseName | Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Technology Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
GroupedDBID | -0Y 2B. 2C0 5XA 5XJ 7SC 8FD 92H 92I ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CUBFJ CW9 GROUPED_DOAJ JQ2 L7M L~C L~D TCJ TGT U1G U5S |
ID | FETCH-proquest_journals_29183419363 |
ISSN | 1002-137X |
IngestDate | Fri Sep 13 00:48:44 EDT 2024 |
IsPeerReviewed | false |
IsScholarly | true |
Issue | 12 |
Language | Chinese |
LinkModel | OpenURL |
MergedId | FETCHMERGED-proquest_journals_29183419363 |
PQID | 2918341936 |
PQPubID | 2048282 |
ParticipantIDs | proquest_journals_2918341936 |
PublicationCentury | 2000 |
PublicationDate | 20230101 |
PublicationDateYYYYMMDD | 2023-01-01 |
PublicationDate_xml | – month: 01 year: 2023 text: 20230101 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | Chongqing |
PublicationPlace_xml | – name: Chongqing |
PublicationTitle | Ji suan ji ke xue |
PublicationYear | 2023 |
Publisher | Guojia Kexue Jishu Bu |
Publisher_xml | – name: Guojia Kexue Jishu Bu |
SSID | ssib023646461 ssib001164759 ssj0057673 ssib017479302 ssib051375750 |
Score | 4.6864 |
Snippet | Compared with traditional replication technique, erasure coding is another data redundancy mechanism with lower space overhead at the cost of high repair... |
SourceID | proquest |
SourceType | Aggregation Database |
StartPage | 89 |
SubjectTerms | Algorithms Big Data Communications traffic Data storage Failure rates Layouts Optimization models Placement Redundancy Storage systems |
Title | Stripe Matching and Merging Algorithm-based Redundancy Transition for Locally Repairable Codes |
URI | https://www.proquest.com/docview/2918341936/abstract/ |
Volume | 50 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ1bT8IwFIAb4ckX78YLmib6tszANgZ7RAQJIsYw4nxx6VgnU2QGtsTw6z3tuotoiPrSLGfJ1uRrz6XpOQehc8Ot6xVXh_3tEkfWam5ZdqhDZNcDg0TAf9YoS3C-7eudoda1qlbWGJJnl4TOxWjxY17Jf6iCDLiyLNk_kE0_CgJ4Br4wAmEYf8V4EMKWZ82DwvhGJL80QWe871Bj8hxA4D9-k5mhYkmILF-M6dK4oLmfXjLsMXM24b448Wc8laoZuOJuYeK3-tI8Ymf2vvRKpY8oXQ5XEYN0D398p8IIgtTi0kd_Ogky4QMXDvz8QYOiLh00XEfBi0-kGwr_kLr-fBxJl1FOc_IuKSrve5-q1rimbLKElJyijPsGfa1_3b-z28NezzZblllABbVSzYXI3L1jxc8y9wuCKdAuWfkyVgtfz5XHq8J0wBstJ5YZQqtanHAhpvrN_nKnwtxCGyIawI0Y7TZaW4x30GbSaQMLxbuLnmLSOCGNgTQWpPESaZyRxhlpDKSxII0z0piT3kNn7ZbZ7MjJPG2x_Oa2YoA21sD_1tV9VJwGU3qAsEHqZdWjXoUQorHBc3V1RFXqUc1VRsYhKq360tHq18doPVsYJVQMZxE9AZ8sdE45qE8joj-- |
link.rule.ids | 315,786,790 |
linkProvider | Directory of Open Access Journals |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Stripe+Matching+and+Merging+Algorithm-based+Redundancy+Transition+for+Locally+Repairable+Codes&rft.jtitle=Ji+suan+ji+ke+xue&rft.au=Du%2C+Qingpeng&rft.au=Xu%2C+Yinlong&rft.au=Wu%2C+Si&rft.date=2023-01-01&rft.pub=Guojia+Kexue+Jishu+Bu&rft.issn=1002-137X&rft.volume=50&rft.issue=12&rft.spage=89&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1002-137X&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1002-137X&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1002-137X&client=summon |