striping · shipping · also data striping, striped volume

Striping (storage)

Striping distributes successive portions of logical data across storage members in a repeating placement pattern.

Placement: Striping is used both without redundancy in RAID 0 and alongside protection in parity RAID. The placement technique alone does not identify failure tolerance. [3] [4]

Sizes: A chunk is the contiguous portion assigned to one member. With N members and c bytes per chunk, a RAID 0 full data stripe contains N x c bytes. In conventional RAID 5/6, full-stripe user data excludes one/two parity chunks. Define chunk size and full-stripe data size explicitly because tools use stripe size differently. [5] [6]

Requests: A four-member RAID 0 with 512 KiB chunks has a 2 MiB full stripe. Starting at a stripe boundary, a 1540 KiB request covers three full chunks and 4 KiB on the fourth member. Thus a request can touch every member without filling a stripe. This mapping arithmetic does not establish simultaneous physical I/O. [2]

Relations

related
RAID, Parity RAID, LVM, Mirroring (storage), Full-stripe write, Stripe unit, RAID 0

Advantages

  • Parallel member access can improve throughput when the workload and shared path permit it. [2]

Limitations

  • Unequal-sized Linux MD RAID 0 members can form narrower stripes in later zones. [1]

Citations

  1. md(4): Multiple Device driver aka Software RAID (Debian bookworm manual page) (accessed 2026-10-20)
  2. Linux kernel documentation: dm-stripe (device-mapper striped target) (accessed 2026-10-20)
  3. SNIA dictionary: data striping (accessed 2026-10-20)
  4. SNIA dictionary: stripe (accessed 2026-10-20)
  5. SNIA dictionary: stripe size (accessed 2026-10-20)
  6. Linux kernel documentation: dm-raid, chunk size and layout (accessed 2026-10-20)

JSON: /data/terms/striping.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Striping (storage). Hesela. 2026-10-20. https://hesela.dev/terms/striping/