A case for redundant arrays of inexpensive disks (RAID)

Patterson, D. A., Gibson, & Katz, R. H. (1988). A case for redundant arrays of inexpensive disks (RAID). Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 109-116.

Type

Journal article

Intellectual base

Primary research

Year

1988

Pages

109-116

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/50202.50214verified

Cited from

cognitive_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Interleaving
  • Storage and communications: RAID striping spreads a file's blocks across multiple devices, and error-correcting interleavers spread a codeword's symbols across time, so that a localized fault — a dead disk, a noise burst — corrupts many small, separately-recoverable fragments rather than one large, unrecoverable block.

    This sourceSeminal RAID paper: striping a file's blocks across multiple disks (with parity) so that a single-disk failure removes only one scattered, separately-recoverable fragment from each file rather than destroying a contiguous whole.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:15aeb13c0f11 · see in the full table