RAID 1

linear + mirror

Derived by hand from the Linux md rule — how the pages are sourced

Every disk holds a full copy of the data, written in step. A read is served by any one copy, a write goes to all of them, and the array survives as long as one copy is left. It keeps one disk's worth of space however many disks it has, and it is the simplest redundancy there is.

What it is

RAID 1 is the pair linear + mirror: nothing is cut into chunks, and every member holds the whole (mirroring). It is the first level of the 1988 paper, "the most expensive option we consider since all disks are duplicated", and every other level is a cheaper answer to the same problem. There is no layout to choose and no chunk size, because there is nothing to place: mdadm does not accept a chunk size for it.

What it buys

The strongest fault tolerance per disk: with n copies, n − 1 failures. The number the level is quoted with, one, is the two-disk case; a three-way mirror survives two, and Windows Storage Spaces offers both as two-way and three-way mirror spaces. It also gives a kind of speed that is easy to misunderstand. One read is served by one disk, at that disk's speed; but n readers at once can each have a copy, because the engine spreads requests over the members (performance). A mirror serves more readers, it does not serve a reader faster.

What it pays

Space: the capacity is one disk's worth, whatever the count, so two disks keep half and three a third. And every write is written n times, at the speed of the slowest copy (write penalty). There is no parity to compute and no read-before-write, which is why a mirror's small writes cost less than a parity array's.

Two things that follow

Two things follow from "every member holds the whole". A mirror of mirrors is just a mirror with more copies, which is why a nested level whose spans have shrunk to two-disk mirrors is recognized as one wide RAID 1. And a RAID 5 on two disks is a RAID 1: with one data block per stripe the parity is that block. The Linux kernel uses this to grow a mirror into a RAID 5: it first relabels the two-disk RAID 1 as a two-disk RAID 5, moving nothing because the two layouts are identical on two disks, and only then adds disks. The rebuild is the simplest of any level, a copy from the surviving member; and, like every redundancy, it copies a deletion as faithfully as anything else (RAID is not a backup).

Segmentation

How an array splits its data across its member disks. Striped cuts the data into fixed-size chunks and deals them out to every member in turn; linear writes it as one run, filling the first member before touching the next. Segmentation is about how many disks take part in one request, not about whether the data survives a failure.

Read more — Segmentation

RAID 1 · 2 disks

          disk 0  disk 1
stripe 0      D0     D0'
stripe 1      D1     D1'
stripe 2      D2     D2'
stripe 3      D3     D3'

Redundancy

How an array keeps its data readable when a member fails: by storing more than the data itself. Two techniques do it. Mirroring keeps whole copies on separate disks; parity keeps a computed summary from which any one missing block, or two with a second parity, can be rebuilt. Redundancy always costs capacity; the question is how much, and how many failures it buys.

Read more — Redundancy

disk size, one copy's worth
N = 2 disks of 2 TB → 2 TB usable, whatever N is

the members an adversary must kill, minus one
mirror: every copy must die → 2 → tolerance 1

one logical write costs
every copy is written → 2 I/Os, random or sequential

Algorithm

The rule that says, stripe by stripe, which member holds the parity and where the data starts, or where a mirror's copies go. The level says what is stored; the algorithm says where. Left-symmetric for the parity levels and near for RAID 10 are the defaults nearly everything uses. The choice changes speed and compatibility, not capacity or safety.

Read more — Placement algorithm

a plain mirror has no layout to choose — every member holds a full copy

Where it runs

The component that turns a RAID layout into disk operations. It owns the array's metadata, translates every request from the array's addresses to the members', writes the copies or computes the parity, and keeps serving when a disk fails. It is a role, not a fixed device: a RAID-on-Chip on a controller card, the operating system's own driver, or a boot firmware working with that driver.

Read more — RAID engine

RAID Engine (RoC)
A dedicated PCIe card that includes BOTH the HBA (protocol translation) AND a RAID-on-Chip (RoC) processor. The RoC computes parity, manages the stripe, and exposes one or more Virtual Drives to the OS — the OS never sees the individual physical disks. Examples: Broadcom MegaRAID, Adaptec SmartRAID.
RAID Engine (RoC, tri-mode)
A RAID-on-Chip controller whose ports speak SAS, SATA and NVMe alike (Broadcom MegaRAID 9500/9600 "tri-mode", Adaptec SmartRAID 3200). NVMe drives plug straight into it — no HBA, no SAS/SATA backplane in between — and it still builds the array itself and exposes one virtual drive to the OS. It is the one way hardware RAID over NVMe exists.
RAID Engine (metadata)
A dedicated chip placed between the HBA and the CPU (on the motherboard or near it) that owns the RAID metadata and boot firmware — no compute silicon of its own. The OS still sees individual disks (unlike hardware RAID) but uses a driver to participate in RAID operations; the actual parity computation runs on the CPU. The canonical example is Intel RST (Rapid Storage Technology) on Intel chipsets. Also known as "motherboard RAID", "BIOS RAID", or, once its wiring reveals what it is, "fake RAID".
OS — Linux
Linux operating system managing the RAID array in software. Uses mdadm (for traditional RAID 0/1/5/6/10) or ZFS (with integrated volume management and checksums). The CPU computes all parity; no dedicated hardware required.
OS — Windows
Windows operating system managing RAID in software via Storage Spaces (Windows 8+/Server 2012+) or legacy Disk Management (dynamic volumes). Storage Spaces supports mirroring, striping, and parity spaces with optional journaling for crash consistency.

Below the minimum

Minimum for the level
2 disks
The real system still starts it at
2 disks
structural — an array of one member is that member; the sandbox refuses it before any level is named (spec §6, the universal ≥ 2)

In practice

Good at

  • Simplest form of redundancy
  • Reads can be served from any member (potential read speedup)
  • Survives N−1 disk failures (n-way mirror)

Costs

  • 1/N usable capacity (50% for 2 disks)
  • Writes go to every disk simultaneously — write throughput limited by slowest disk

Used for

  • Operating system drives
  • Small databases needing high availability
  • Any data too critical to lose

Not for

  • Large storage pools (high capacity overhead)
  • High-throughput write workloads

Try it

Open this example in the sandbox

A desktop link: below the desktop breakpoint the sandbox is not offered (ADR-003).

See also

Related

Often confused with