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
- Linux v6.12: RAID arrays, dirty/degraded assembly and bitmap metadata
- SNIA Dictionary: RAID 5
- mdadm md(4): RAID4/5/6 layouts and capacity (revision e5a1d3e)
- Hesela: RAID 5/6 capacity and per-stripe recovery boundaries