Two-Erasure Codes from 3-Plexes - Network and Parallel Computing Access content directly
Conference Papers Year : 2019

Two-Erasure Codes from 3-Plexes

Liping Yi
  • Function : Author
  • PersonId : 1161634
Rebecca J. Stones
  • Function : Author
  • PersonId : 1161635
Gang Wang
  • Function : Author
  • PersonId : 1161061

Abstract

We present a family of parity array codes called 3-PLEX for tolerating two disk failures in storage systems. It only uses exclusive-or operations to compute parity symbols. We give two data/parity layouts for 3-PLEX: (a) When the number of disks in array is at most 6, we use a horizontal layout which is similar to EVENODD codes, (b) otherwise we choose hybrid layout like HoVer codes. The major advantage of 3-PLEX is that it has optimal encoding/decoding/updating complexity in theory and the number of disks in a 3-PLEX disk array is less constrained than other array codes, which enables greater parameter flexibility for trade-offs in storage efficiency and performances.
Fichier principal
Vignette du fichier
486810_1_En_21_Chapter.pdf (690.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03770534 , version 1 (06-09-2022)

Licence

Attribution

Identifiers

Cite

Liping Yi, Rebecca J. Stones, Gang Wang. Two-Erasure Codes from 3-Plexes. 16th IFIP International Conference on Network and Parallel Computing (NPC), Aug 2019, Hohhot, China. pp.264-276, ⟨10.1007/978-3-030-30709-7_21⟩. ⟨hal-03770534⟩
12 View
17 Download

Altmetric

Share

Gmail Facebook X LinkedIn More