parity-raid · shipping

Parity RAID

Parity RAID uses computed redundancy across striped data to reconstruct missing chunks without storing complete mirrored copies.

Distributed parity occupies the equivalent capacity of one member in RAID 5 or two in conventional RAID 6, rather than requiring dedicated parity devices [4]. This is coded redundancy, not a full duplicate of the data. Parity consistency after an interrupted update depends on the write and recovery protocol [1]. A RAID level describes a reconstruction capability, not a measured probability of data loss [5].

Relations

related
RAID 5, RAID 6, Erasure coding, Reed–Solomon codes (storage), RAID write hole, Partial Parity Log, Write-intent bitmap, Read-modify-write, Degraded array

Limitations

  • An interrupted update can invalidate parity needed to recover a missing member; review the write-hole protection policy. [1]

Citations

  1. Linux v6.12: RAID arrays, dirty/degraded assembly and bitmap metadata (accessed 2026-10-11)
  2. mdadm md(4): RAID4/5/6 layouts and capacity (revision e5a1d3e) (accessed 2026-10-15)
  3. Hesela: RAID 5/6 capacity and per-stripe recovery boundaries (accessed 2026-10-15)

Further reading

  1. Linux v6.12: Partial Parity Log (accessed 2026-10-11)
  2. Hesela: RAID write hole, bitmap and PPL (accessed 2026-10-11)

JSON: /data/terms/parity-raid.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Parity RAID. Hesela. 2026-10-15. https://hesela.dev/terms/parity-raid/