raid-5 · shipping · also RAID5

RAID 5

RAID 5 stripes data and distributed single parity across members so that one missing member can be reconstructed when the remaining required information is readable and consistent.

For N equal-sized active members of capacity S, nominal data capacity is (N - 1) x S before metadata and filesystem overhead; a standby spare is not an active member in this count [6]. One missing member consumes single-parity protection for each affected stripe. An additional unreadable fragment needed in that stripe can prevent reconstruction, without establishing loss of every file [7]. Protection against one missing member does not itself make multi-member updates crash-atomic [1].

Relations

related
RAID, Parity RAID, Erasure coding, RAID write hole, Partial Parity Log, Write-intent bitmap, Latent sector error, Data scrubbing, Read-modify-write, RAID 6, Degraded array, RAID rebuild, LVM, Stripe unit, Differential RAID

Advantages

  • Distributed parity avoids dedicating one member to all parity blocks. [5]

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. SNIA Dictionary: RAID 5 (accessed 2026-10-15)
  3. mdadm md(4): RAID4/5/6 layouts and capacity (revision e5a1d3e) (accessed 2026-10-15)
  4. 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)
  3. Hesela: Scrubbing, detection time and repair boundaries (accessed 2026-10-11)

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

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. RAID 5. Hesela. 2026-10-20. https://hesela.dev/terms/raid-5/