Reliability of flat XOR-based erasure codes on heterogeneous devices

被引:14
|
作者
Greenan, Kevin M. [1 ]
Miller, Ethan L. [2 ]
Wylie, Jay J. [1 ]
机构
[1] Hewlett Packard Labs, Mississauga, ON, Canada
[2] UCSC, Santa Cruz, CA USA
关键词
D O I
10.1109/DSN.2008.4630083
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
XOR-based erasure codes are a computationally-efficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets of failed storage devices of a given size lead to data loss, whereas other subsets of failed storage devices of the same size are tolerated Many storage systems are composed of heterogeneous devices that exhibit different failure and recovery rates, in which different placements-mappings of erasure-coded symbols to storage devices-of a flat XOR-based erasure code lead to different reliabilities. We have developed redundancy placement algorithms that utilize the structure of flat XOR-based erasure codes and a simple analytic model to determine placements that maximize reliability. Simulation studies validate the utility of the simple analytic reliability model and the efficacy of the redundancy placement algorithms.
引用
收藏
页码:147 / +
页数:3
相关论文
共 50 条
  • [1] Efficient Encoding Schedules for XOR-Based Erasure Codes
    Luo, Jianqiang
    Shrestha, Mochan
    Xu, Lihao
    Plank, James S.
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (09) : 2259 - 2272
  • [2] A New Decoding Algorithm for XOR-Based Erasure Codes
    Chen R.
    Xu L.
    [J]. SN Computer Science, 2020, 1 (3)
  • [3] Flat XOR-based erasure codes in storage systems: Constructions, efficient recovery, and tradeoffs
    Greenan, Kevin M.
    Li, Xiaozhou
    Wylie, Jay J.
    [J]. 2010 IEEE 26TH SYMPOSIUM ON MASS STORAGE SYSTEMS AND TECHNOLOGIES (MSST), 2010,
  • [4] Finding the most fault-tolerant flat XOR-based erasure codes for storage systems
    Wylie, Jay J.
    [J]. 2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 1788 - 1792
  • [5] Cerasure: Fast Acceleration Strategies For XOR-Based Erasure Codes
    Niu, Tianyang
    Lyu, Min
    Wang, Wei
    Li, Qiliang
    Xu, Yinlong
    [J]. 2023 IEEE 41ST INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, ICCD, 2023, : 535 - 542
  • [6] Determining fault tolerance of XOR-based erasure codes efficiently
    Wylie, Jay J.
    Swaminathan, Ram
    [J]. 37TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2007, : 206 - 215
  • [7] In-Memory Checkpointing for MPI Programs by XOR-Based Double-Erasure Codes
    Wang, Gang
    Liu, Xiaoguang
    Li, Ang
    Zhang, Fan
    [J]. RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, PROCEEDINGS, 2009, 5759 : 84 - 93
  • [8] Stable XOR-Based Policies for the Broadcast Erasure Channel With Feedback
    Athanasiadou, Sophia
    Gatzianas, Marios
    Georgiadis, Leonidas
    Tassiulas, Leandros
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (01) : 476 - 491
  • [9] PCM: A Parity-check Matrix Based Approach to Improve Decoding Performance of XOR-based Erasure Codes
    Zhang, Yongzhe
    Wu, Chentao
    Li, Jie
    Guo, Minyi
    [J]. 2015 IEEE 34TH SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS), 2015, : 182 - 191
  • [10] Polynomial Ring Transforms for Efficient XOR-based Erasure Coding
    Detchart, Jonathan
    Lacan, Jerome
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 604 - 608