• DocumentCode
    2429256
  • Title

    EEO: an efficient MDS-like RAID-6 code for parallel implementation

  • Author

    Feng, Jun ; Chen, Yu ; Summerville, Douglas

  • Author_Institution
    Dept. of Electr. & Comput. Eng., SUNY - Binghamton, Binghamton, NY, USA
  • fYear
    2010
  • fDate
    12-14 April 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In recent years, researchers have found that some XOR erasure codes lead to higher performance and better throughput in fault-tolerant distributed data storage applications. However, little consideration has been given to the advantages of parallel processing or hardware implementations taking advantage of the emergence of multi-core processors. This paper presents an efficient horizontal MDS-like (Maximum Distance Separable) RAID-6 scheme, called EEO, which significantly improves the performance of the decoding procedure in parallel implementations with little storage overhead. We show that EEO is the fastest and most efficient double disk failure recovering algorithm in RAID-6 at the cost of only two more parity symbols. In practice, it is very useful for application where high decoding throughput is desired.
  • Keywords
    codes; multi-threading; multiprocessing systems; parallel algorithms; software fault tolerance; EEO scheme; MDS-like RAID-6 code; XOR erasure codes; fault-tolerant distributed data storage; maximum distance separable scheme; multicore processors; parallel implementation; parity symbols; redundant array of independent disks; Concurrent computing; Data engineering; Distributed computing; Fault tolerance; Hardware; High performance computing; Iterative decoding; Multicore processing; Reed-Solomon codes; Throughput; Fault-tolerant; RAID-6; Storage System; XOR;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sarnoff Symposium, 2010 IEEE
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4244-5592-8
  • Type

    conf

  • DOI
    10.1109/SARNOF.2010.5469753
  • Filename
    5469753