• DocumentCode
    1935210
  • Title

    Finding the most fault-tolerant flat XOR-based erasure codes for storage systems

  • Author

    Wylie, Jay J.

  • Author_Institution
    HP Labs., USA
  • fYear
    2011
  • fDate
    6-9 Nov. 2011
  • Firstpage
    1788
  • Lastpage
    1792
  • Abstract
    We describe the techniques we developed to efficiently find the most fault-tolerant flat XOR-based erasure codes for storage systems. These techniques substantially reduce the search space for finding fault-tolerant codes (e.g., by a factor of over 52 trillion in one case). This reduction in the search space has allowed us to find the most fault-tolerant codes for larger codes than was previously thought feasible. The result of our effort to find the most fault-tolerant flat XOR-based erasure codes for storage systems has yielded a corpus of 49,215 erasure codes that we are making public.
  • Keywords
    codes; fault tolerant computing; storage management; fault-tolerant flat XOR-based erasure code; search space; storage system; Fault tolerance; Fault tolerant systems; Force; Hamming distance; Parity check codes; Space exploration; Systematics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • ISSN
    1058-6393
  • Print_ISBN
    978-1-4673-0321-7
  • Type

    conf

  • DOI
    10.1109/ACSSC.2011.6190329
  • Filename
    6190329