{
  "slug": "full-stripe-write",
  "term": "Full-stripe write",
  "aliases": [
    "full stripe write"
  ],
  "definition": "A parity-array write supplying replacement data for every data position of a stripe so its new parity can be computed without reading the prior stripe contents.",
  "note": "Parity is still written: a healthy stripe with k equal-size data blocks and p parity blocks writes k+p blocks for k blocks of payload in Hesela's model. Covering the stripe requires the appropriate address alignment and aggregation at the parity layer, not merely a host request of matching length. Linux MD's journal may collect writes before destaging; cache capacity and timing constrain that aggregation.",
  "advantages": [
    "Eliminates old-data and old-parity reads for parity computation when all replacement data is present"
  ],
  "limitations": [
    "Does not eliminate parity write traffic, lower-layer overhead or crash-consistency requirements",
    "Request splitting and misalignment can leave partial stripes",
    "Early acknowledgement from a write-back journal is a different durability boundary from final member placement"
  ],
  "related": [
    "read-modify-write",
    "reconstruct-write",
    "parity-raid",
    "raid-write-hole",
    "write-amplification"
  ],
  "status": "shipping",
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-11",
  "citations": [
    {
      "id": "linux-cache",
      "title": "Linux kernel documentation: RAID 4/5/6 cache, write-back mode and implementation. Rolling documentation; accessed 11 October 2026.",
      "url": "https://www.kernel.org/doc/html/latest/driver-api/md/raid5-cache.html",
      "accessed": "2026-10-11"
    },
    {
      "id": "hesela-cost",
      "title": "Hesela: RAID write penalty is not a speed ratio; model and limitations",
      "url": "https://hesela.com/analyses/raid-write-penalty-io-not-speed/",
      "accessed": "2026-10-11"
    }
  ]
}